OOIR: Observatory of International Research

Papers

(The H4-Index of IEEE Transactions on Information Theory is 34. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-03-01 to 2024-03-01.)

Article	Citations
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding	122
Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access With a Massive MIMO Receiver	106
A Coded Compressed Sensing Scheme for Unsourced Multiple Access	97
The Age of Information in Networks: Moments, Distributions, and Sampling	92
An Operational Approach to Information Leakage	82
An Efficient Framework for Clustered Federated Learning	73
Private Information Retrieval With Side Information	72
An Index Coding Approach to Caching With Uncoded Cache Placement	66
Deep Neural Network Approximation Theory	65
Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching	58
SPARCs for Unsourced Random Access	54
Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs	54
GASP Codes for Secure Distributed Matrix Multiplication	54
Gradient Coding From Cyclic MDS Codes and Expander Graphs	50
The Capacity of T-Private Information Retrieval With Private Side Information	48
Levenshtein Distance, Sequence Comparison and Biological Database Search	48
Low-Tubal-Rank Tensor Completion Using Alternating Minimization	48
Super-Resolution Limit of the ESPRIT Algorithm	47
Coding Over Sets for DNA Storage	46
Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks	44
Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions	43
Quantum LDPC Codes With Almost Linear Minimum Distance	42
Coded Trace Reconstruction	41
Balanced Product Quantum Codes	40
C-Differentials, Multiplicative Uniformity, and (Almost) Perfect c-Nonlinearity	39

Infinite Families of Near MDS Codes Holding t-Designs	39
Recursive Projection-Aggregation Decoding of Reed-Muller Codes	37
Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization	36
Waiting Before Serving: A Companion to Packet Management in Status Update Systems	35
Capacity-Approaching Constrained Codes With Error Correction for DNA-Based Data Storage	35
On Optimal k-Deletion Correcting Codes	35
X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers	35
Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation	34
Capacity-Achieving Private Information Retrieval Codes From MDS-Coded Databases With Minimum Message Size	34
An Infinite Family of Linear Codes Supporting 4-Designs	34