IEEE Transactions on Information Theory

Papers
(The median citation count of IEEE Transactions on Information Theory is 2. 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.)
ArticleCitations
Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access With a Massive MIMO Receiver133
An Efficient Framework for Clustered Federated Learning123
Deep Neural Network Approximation Theory79
SPARCs for Unsourced Random Access74
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels72
Levenshtein Distance, Sequence Comparison and Biological Database Search64
Balanced Product Quantum Codes61
Gradient Coding From Cyclic MDS Codes and Expander Graphs59
Age of Information in Random Access Channels56
Quantum LDPC Codes With Almost Linear Minimum Distance54
Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks52
The Quantum Wasserstein Distance of Order 151
Capacity-Approaching Constrained Codes With Error Correction for DNA-Based Data Storage50
Two-Timescale Design for Reconfigurable Intelligent Surface-Aided Massive MIMO Systems With Imperfect CSI49
Unsourced Random Access With Coded Compressed Sensing: Integrating AMP and Belief Propagation47
On Optimal k-Deletion Correcting Codes44
An Information-Theoretic Approach to Joint Sensing and Communication44
Hadamard-Free Circuits Expose the Structure of the Clifford Group44
X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers43
DNA-Based Storage: Models and Fundamental Limits43
Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization42
On Coded Caching With Private Demands42
Reed–Muller Codes: Theory and Algorithms41
An Infinite Family of Linear Codes Supporting 4-Designs40
Cross Subspace Alignment Codes for Coded Distributed Batch Computation39
Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality39
New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes38
Age-Delay Tradeoffs in Queueing Systems36
Secure Coded Multi-Party Computation for Massive Matrix Operations35
Peak Age of Information in Priority Queuing Systems35
Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 634
Cooperative Localization in Massive Networks34
Adaptive Social Learning34
Numerically Stable Polynomially Coded Computing33
Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes33
The Role of Coded Side Information in Single-Server Private Information Retrieval32
Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach32
The Capacity of Private Information Retrieval From Uncoded Storage Constrained Databases31
On the Capacity of Secure Distributed Batch Matrix Multiplication30
Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes29
An Overview of Capacity Results for Synchronization Channels29
Generalization Error Bounds via Rényi-, f-Divergences and Maximal Leakage29
Memory AMP29
Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound28
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets28
Bayes-Optimal Convolutional AMP27
MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction27
Fundamental Limits of Many-User MAC With Finite Payloads and Fading27
A Revisit to Ordered Statistics Decoding: Distance Distribution and Decoding Rules27
Investigations on c-(Almost) Perfect Nonlinear Functions27
Multi-Marginal Optimal Transport and Probabilistic Graphical Models27
Hierarchical Coded Matrix Multiplication26
Capacity Optimality of AMP in Coded Systems26
Closed-Form Characterization of the MGF of AoI in Energy Harvesting Status Update Systems26
New LCD MDS Codes of Non-Reed-Solomon Type26
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size25
A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching25
Hulls of Generalized Reed-Solomon Codes via Goppa Codes and Their Applications to Quantum Codes25
Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction24
Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis24
Phase Transition Analysis for Covariance-Based Massive Random Access With Massive MIMO24
Fundamental Limits of Combinatorial Multi-Access Caching24
Efficient and Robust Distributed Matrix Computations via Convolutional Coding24
Private Set Intersection: A Multi-Message Symmetric Private Information Retrieval Perspective23
Coded Sparse Matrix Computation Schemes That Leverage Partial Stragglers23
Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels23
Secure Distributed Matrix Computation With Discrete Fourier Transform22
Distributed Multi-User Secret Sharing22
Synchronization Strings and Codes for Insertions and Deletions—A Survey22
Circuit Knitting With Classical Communication22
Resolving the Feedback Bottleneck of Multi-Antenna Coded Caching22
On the Storage Cost of Private Information Retrieval22
Semantic Private Information Retrieval22
Distributed Online Linear Regressions22
Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters22
X-Secure T-Private Federated Submodel Learning With Elastic Dropout Resilience22
Coding Theorems for Noisy Permutation Channels22
Asymmetric Leaky Private Information Retrieval21
A New Family of APN Quadrinomials21
Information Theoretic Secure Aggregation With User Dropouts21
Reed-Muller Codes Polarize21
Fundamental Properties of Sum-Rank-Metric Codes20
Random Access Channel Coding in the Finite Blocklength Regime20
Cumulative Residual and Relative Cumulative Residual Fisher Information and Their Properties20
Repeat-Free Codes20
Subexponential and Linear Subpacketization Coded Caching via Projective Geometry20
Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs19
Capacity of Quantum Private Information Retrieval With Multiple Servers19
CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplication19
Settling the Sharp Reconstruction Thresholds of Random Graph Matching19
Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding With Constant Compositions19
Coding for Sequence Reconstruction for Single Edits19
Twisted Reed–Solomon Codes19
Quantum Differential Privacy: An Information Theory Perspective19
New Instances of Quadratic APN Functions18
Multiclass Classification by Sparse Multinomial Logistic Regression18
Secrecy by Design With Applications to Privacy and Compression18
Information-Theoretic and Algorithmic Thresholds for Group Testing18
Two Families of Optimal Linear Codes and Their Subfield Codes18
Geometric Lower Bounds for Distributed Parameter Estimation Under Communication Constraints18
Free Ride on LDPC Coded Transmission18
CRC-Aided List Decoding of Convolutional Codes in the Short Blocklength Regime18
Parallel Multilevel Constructions for Constant Dimension Codes18
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design18
The q-Ary Antiprimitive BCH Codes18
Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry18
Theory of Communication Efficient Quantum Secret Sharing18
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes18
Deconstructing Generative Adversarial Networks18
On Linear Codes With One-Dimensional Euclidean Hull and Their Applications to EAQECCs18
On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval18
On Coding Over Sliced Information18
Coded Distributed Computing With Partial Recovery18
Non-Asymptotic Classical Data Compression With Quantum Side Information18
Trace Reconstruction Problems in Computational Biology18
Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces17
Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis17
New MDS Euclidean Self-Orthogonal Codes17
Cascade Codes for Distributed Storage Systems17
Deterministic Identification Over Channels With Power Constraints17
Numerically Stable Coded Matrix Computations via Circulant and Rotation Matrix Embeddings17
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns17
Quantum Algorithm for Fidelity Estimation17
Single-Error Detection and Correction for Duplication and Substitution Channels17
A Framework for Characterizing the Value of Information in Hidden Markov Models17
Sparse Composite Quantile Regression in Ultrahigh Dimensions With Tuning Parameter Calibration17
On Permutation Quadrinomials and 4-Uniform BCT17
Multi-Armed Bandits With Correlated Arms17
The c-Differential Uniformity and Boomerang Uniformity of Two Classes of Permutation Polynomials17
Computing Quantum Channel Capacities17
An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures16
Capacity of Broadcast Packet Erasure Channels With Single-User Delayed CSI16
On the Stable Resolution Limit of Total Variation Regularization for Spike Deconvolution16
Multi-Server Weakly-Private Information Retrieval16
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction16
Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting16
On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions16
Constructions of Optimal Uniform Wide-Gap Frequency-Hopping Sequences16
Encoder-Assisted Communications Over Additive Noise Channels16
Capacity of Quantum Private Information Retrieval With Colluding Servers16
Generalized Linkage Construction for Constant-Dimension Codes16
How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths?16
Distances Between Probability Distributions of Different Dimensions16
Inference Under Information Constraints II: Communication Constraints and Shared Randomness16
Systematic Codes Correcting Multiple-Deletion and Multiple-Substitution Errors15
Minimax Optimal Estimation of KL Divergence for Continuous Distributions15
Nonasymptotic Performance Analysis of ESPRIT and Spatial-Smoothing ESPRIT15
Entropy and Relative Entropy From Information-Theoretic Principles15
Quantum CDMA Communication Systems15
Pursuing the Fundamental Limits for Quantum Communication15
How to Reduce Dimension With PCA and Random Projections?15
Large Deviations Behavior of the Logarithmic Error Probability of Random Codes15
The Geometry of Two-Weight Codes Over ℤpm15
The Capacity of Private Information Retrieval Under Arbitrary Collusion Patterns for Replicated Databases15
Toward a Definitive Compressibility Measure for Repetitive Sequences15
A Theory of Computational Resolution Limit for Line Spectral Estimation15
Three New Constructions of Optimal Locally Repairable Codes From Matrix-Product Codes15
Toward a Union-Find Decoder for Quantum LDPC Codes15
The Global Optimization Geometry of Low-Rank Matrix Optimization15
MDS, Near-MDS or 2-MDS Self-Dual Codes via Twisted Generalized Reed-Solomon Codes14
The Dual Codes of Several Classes of BCH Codes14
Quantized Compressed Sensing by Rectified Linear Units14
A Single-Letter Upper Bound to the Mismatch Capacity14
On Hulls of Some Primitive BCH Codes and Self-Orthogonal Codes14
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions14
Two-Stage Estimation for Quantum Detector Tomography: Error Analysis, Numerical and Experimental Results14
Efficient Multi Port-Based Teleportation Schemes14
New Construction of Optimal Type-II Binary Z-Complementary Pairs14
Uncertainty-of-Information Scheduling: A Restless Multiarmed Bandit Framework14
Toward the Capacity of Private Information Retrieval From Coded and Colluding Servers14
Shortened Linear Codes Over Finite Fields14
Sensing RISs: Enabling Dimension-Independent CSI Acquisition for Beamforming14
Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding14
Entanglement-Assisted Quantum Codes From Algebraic Geometry Codes14
A Complete Study of Two Classes of Boolean Functions: Direct Sums of Monomials and Threshold Functions14
Second-Order Asymptotics of Sequential Hypothesis Testing13
Epsilon-Nets, Unitary Designs, and Random Quantum Circuits13
New Constructions of Optimal Locally Repairable Codes With Super-Linear Length13
Positivity and Nonadditivity of Quantum Capacities Using Generalized Erasure Channels13
Energy Efficiency of Massive Random Access in MIMO Quasi-Static Rayleigh Fading Channels With Finite Blocklength13
Some Punctured Codes of Several Families of Binary Linear Codes13
Polar Codes’ Simplicity, Random Codes’ Durability13
Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes13
Single-Shot Decoding of Linear Rate LDPC Quantum Codes With High Performance13
Improved Maximally Recoverable LRCs Using Skew Polynomials13
A New Method for Searching Optimal Differential and Linear Trails in ARX Ciphers13
Constructions of Optimal Codes With Hierarchical Locality13
Breaking the Communication-Privacy-Accuracy Trilemma13
Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols13
Learning Quantum Circuits of Some T Gates13
On the Approximation Ratio of Ordered Parsings13
Universality Laws for High-Dimensional Learning With Random Features13
Streaming Codes for Variable-Size Messages13
Ultrahigh-Dimensional Robust and Efficient Sparse Regression Using Non-Concave Penalized Density Power Divergence13
On Linearly Precoded Rate Splitting for Gaussian MIMO Broadcast Channels13
Data Encoding for Byzantine-Resilient Distributed Optimization13
Quantum Differentially Private Sparse Regression Learning13
Teaching and Learning in Uncertainty13
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric13
Distributed Linearly Separable Computation13
Sample-Efficient Low Rank Phase Retrieval13
The DNA Storage Channel: Capacity and Error Probability Bounds13
A Unified Framework for One-Shot Achievability via the Poisson Matching Lemma13
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy13
Beyond Single-Shot Fault-Tolerant Quantum Error Correction13
Optimal Spectral Shrinkage and PCA With Heteroscedastic Noise13
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification13
Dihedral Multi-Reference Alignment13
Thomson’s Multitaper Method Revisited12
Covert Communication Over Adversarially Jammed Channels12
Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding12
Quantum Channel State Masking12
Linear Coded Caching Scheme for Centralized Networks12
On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of Information12
A Bayesian Theory of Change Detection in Statistically Periodic Random Processes12
On the Hull-Variation Problem of Equivalent Linear Codes12
Polar Decreasing Monomial-Cartesian Codes12
Variations on a Theme by Massey12
Computer Classification of Linear Codes12
Efficient Explicit Constructions of Multipartite Secret Sharing Schemes12
Nearly Optimal Sparse Polynomial Multiplication12
Torn-Paper Coding12
Universal Lossless Compression of Graphical Data12
Compressed Sensing With Upscaled Vector Approximate Message Passing12
Encoding Classical Information Into Quantum Resources12
Close Encounters of the Binary Kind: Signal Reconstruction Guarantees for Compressive Hadamard Sampling With Haar Wavelet Basis12
Error-Correcting Codes for Noisy Duplication Channels12
Correcting Deletions With Multiple Reads12
A Deterministic Theory of Low Rank Matrix Completion12
Optimal Causal Rate-Constrained Sampling for a Class of Continuous Markov Processes12
Binary Linear Codes With Few Weights From Two-to-One Functions12
Unsourced Multiple Access With Random User Activity12
A New Method for Employing Feedback to Improve Coding Performance12
How Many Weights Can a Quasi-Cyclic Code Have?12
Further Study of 2-to-1 Mappings Over F2n 11
Partial Information Sharing Over Social Learning Networks11
De-Biased Sparse PCA: Inference for Eigenstructure of Large Covariance Matrices11
Uplink-Downlink Duality Between Multiple-Access and Broadcast Channels With Compressing Relays11
Communication Over Quantum Channels With Parameter Estimation11
Shapes of Uncertainty in Spectral Graph Theory11
Keyless Covert Communication via Channel State Information11
Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling11
Full Coded Caching Gains for Cache-Less Users11
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime11
Reconstruction of Strings From Their Substrings Spectrum11
On the Differential Spectrum and the APcN Property of a Class of Power Functions Over Finite Fields11
Geometric Approach tob-Symbol Hamming Weights of Cyclic Codes11
Repairing Reed-Solomon Codes via Subspace Polynomials11
Analysis of KNN Density Estimation11
Learning Algorithms for Minimizing Queue Length Regret11
0.03671407699585