OOIR: Observatory of International Research

Papers

(The H4-Index of IEEE Transactions on Information Theory is 33. 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-11-01 to 2024-11-01.)

Article	Citations
Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access With a Massive MIMO Receiver	133
An Efficient Framework for Clustered Federated Learning	123
Deep Neural Network Approximation Theory	79
SPARCs for Unsourced Random Access	74
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	72
Levenshtein Distance, Sequence Comparison and Biological Database Search	64
Balanced Product Quantum Codes	61
Gradient Coding From Cyclic MDS Codes and Expander Graphs	59
Age of Information in Random Access Channels	56
Quantum LDPC Codes With Almost Linear Minimum Distance	54
Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks	52
The Quantum Wasserstein Distance of Order 1	51
Capacity-Approaching Constrained Codes With Error Correction for DNA-Based Data Storage	50
Two-Timescale Design for Reconfigurable Intelligent Surface-Aided Massive MIMO Systems With Imperfect CSI	49
Unsourced Random Access With Coded Compressed Sensing: Integrating AMP and Belief Propagation	47
Hadamard-Free Circuits Expose the Structure of the Clifford Group	44
On Optimal k-Deletion Correcting Codes	44
An Information-Theoretic Approach to Joint Sensing and Communication	44
DNA-Based Storage: Models and Fundamental Limits	43
X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers	43
On Coded Caching With Private Demands	42
Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization	42
Reed–Muller Codes: Theory and Algorithms	41
An Infinite Family of Linear Codes Supporting 4-Designs	40
Cross Subspace Alignment Codes for Coded Distributed Batch Computation	39

Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality	39
New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes	38
Age-Delay Tradeoffs in Queueing Systems	36
Peak Age of Information in Priority Queuing Systems	35
Secure Coded Multi-Party Computation for Massive Matrix Operations	35
Cooperative Localization in Massive Networks	34
Adaptive Social Learning	34
Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6	34
Numerically Stable Polynomially Coded Computing	33
Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes	33