IEEE Transactions on Information Theory

Article	Citations
Non-Bayesian Activity Detection, Large-Scale Fading Coefficient Estimation, and Unsourced Random Access With a Massive MIMO Receiver	112
A Coded Compressed Sensing Scheme for Unsourced Multiple Access	101
The Age of Information in Networks: Moments, Distributions, and Sampling	96
An Efficient Framework for Clustered Federated Learning	82
Private Information Retrieval With Side Information	74
Deep Neural Network Approximation Theory	67
Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching	60
Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs	59
SPARCs for Unsourced Random Access	59
GASP Codes for Secure Distributed Matrix Multiplication	54
The Capacity of T-Private Information Retrieval With Private Side Information	51
Levenshtein Distance, Sequence Comparison and Biological Database Search	50
Coding Over Sets for DNA Storage	50
Gradient Coding From Cyclic MDS Codes and Expander Graphs	50
Super-Resolution Limit of the ESPRIT Algorithm	47
Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks	45
Quantum LDPC Codes With Almost Linear Minimum Distance	45
Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions	44
Balanced Product Quantum Codes	43
Coded Trace Reconstruction	43
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	38
Waiting Before Serving: A Companion to Packet Management in Status Update Systems	36
X-Secure T-Private Information Retrieval From MDS Coded Storage With Byzantine and Unresponsive Servers	36

On Optimal k-Deletion Correcting Codes	36
Capacity-Approaching Constrained Codes With Error Correction for DNA-Based Data Storage	36
Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization	36
Mutual Information and Optimality of Approximate Message-Passing in Random Linear Estimation	35
An Infinite Family of Linear Codes Supporting 4-Designs	35
Capacity-Achieving Private Information Retrieval Codes From MDS-Coded Databases With Minimum Message Size	34
On Optimal Locally Repairable Codes With Super-Linear Length	34
Unsourced Random Access With Coded Compressed Sensing: Integrating AMP and Belief Propagation	34
DNA-Based Storage: Models and Fundamental Limits	34
On Coded Caching With Private Demands	34
Age of Information in Random Access Channels	34
The Quantum Wasserstein Distance of Order 1	33
Hadamard-Free Circuits Expose the Structure of the Clifford Group	33
Secure Coded Multi-Party Computation for Massive Matrix Operations	32
Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality	31
The Capacity of Private Information Retrieval From Heterogeneous Uncoded Caching Databases	31
Reed–Muller Codes: Theory and Algorithms	30
Peak Age of Information in Priority Queuing Systems	29
Cross Subspace Alignment Codes for Coded Distributed Batch Computation	29
On the Robustness of Information-Theoretic Privacy Measures and Mechanisms	29
Distributed Hypothesis Testing Over Discrete Memoryless Channels	28
Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures	28
Cooperative Localization in Massive Networks	28
New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes	28
Bounds and Constructions of Locally Repairable Codes: Parity-Check Matrix Approach	28
Two Deletion Correcting Codes From Indicator Vectors	28
Age-Delay Tradeoffs in Queueing Systems	28
The Capacity of Private Information Retrieval From Uncoded Storage Constrained Databases	27
The Role of Coded Side Information in Single-Server Private Information Retrieval	27
Optimal Source Codes for Timely Updates	27
Completing the Grand Tour of Asymptotic Quantum Coherence Manipulation	26
The Capacity of Private Information Retrieval With Private Side Information Under Storage Constraints	26
Private Information Retrieval Through Wiretap Channel II: Privacy Meets Security	26
Quantum Channel Simulation and the Channel’s Smooth Max-Information	26
Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 6	26
Vector Gaussian CEO Problem Under Logarithmic Loss and Applications	26
Numerically Stable Polynomially Coded Computing	25
Investigations on c-(Almost) Perfect Nonlinear Functions	25
Constructing APN Functions Through Isotopic Shifts	25
Two-Timescale Design for Reconfigurable Intelligent Surface-Aided Massive MIMO Systems With Imperfect CSI	25
Minimal Linear Codes From Characteristic Functions	25
Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs	25
A Unified Approach to Construct MDS Self-Dual Codes via Reed-Solomon Codes	25
A Framework of Constructing Placement Delivery Arrays for Centralized Coded Caching	25
Full Characterization of Minimal Linear Codes as Cutting Blocking Sets	25
The Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel: An Upper Bound on the Number of Mass Points	25
On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences	24
Adaptive Social Learning	24
Entropic Proofs of Singleton Bounds for Quantum Error-Correcting Codes	24
Content Based Status Updates	24

A Revisit to Ordered Statistics Decoding: Distance Distribution and Decoding Rules	24
Atomic Norm Denoising for Complex Exponentials With Unknown Waveform Modulations	23
On the Capacity of MIMO Optical Wireless Channels	23
MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction	23
An Information-Theoretic Approach to Joint Sensing and Communication	23
Closed-Form Characterization of the MGF of AoI in Energy Harvesting Status Update Systems	23
New Constructions of Subspace Codes Using Subsets of MRD Codes in Several Blocks	22
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	22
Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities	22
Inference Under Information Constraints I: Lower Bounds From Chi-Square Contraction	22
An Overview of Capacity Results for Synchronization Channels	22
Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters	22
Fundamental Limits of Many-User MAC With Finite Payloads and Fading	22
Capacity Optimality of AMP in Coded Systems	21
On the Storage Cost of Private Information Retrieval	21
Reed-Muller Codes Polarize	21
One-Shot PIR: Refinement and Lifting	21
A Framework for Quantum-Secure Device-Independent Randomness Expansion	21
Phase Transition Analysis for Covariance-Based Massive Random Access With Massive MIMO	21
Multi-Marginal Optimal Transport and Probabilistic Graphical Models	21
Joint Sparse Recovery Using Signal Space Matching Pursuit	21
Generalization Error Bounds via Rényi-, f-Divergences and Maximal Leakage	21
Coded Sparse Matrix Computation Schemes That Leverage Partial Stragglers	21
A New Family of APN Quadrinomials	20
Hulls of Generalized Reed-Solomon Codes via Goppa Codes and Their Applications to Quantum Codes	20
On the Capacity of Secure Distributed Batch Matrix Multiplication	20
Noisy Non-Adaptive Group Testing: A (Near-)Definite Defectives Approach	20
New LCD MDS Codes of Non-Reed-Solomon Type	20
Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels	20
A Class of Quadrinomial Permutations With Boomerang Uniformity Four	20
Hierarchical Coded Matrix Multiplication	20
On the Algorithmic Solvability of Spectral Factorization and Applications	20
Infinite Families of Optimal Linear Codes Constructed From Simplicial Complexes	20
Bayes-Optimal Convolutional AMP	20
Private Information Retrieval in Graph-Based Replication Systems	19
Quickest Detection of Dynamic Events in Networks	19
On Capacity-Achieving Distributions for Complex AWGN Channels Under Nonlinear Power Constraints and Their Applications to SWIPT	19
Synchronization Strings and Codes for Insertions and Deletions—A Survey	19
Asymmetric Leaky Private Information Retrieval	19
Permutation-Invariant Constant-Excitation Quantum Codes for Amplitude Damping	19
Distributed Online Linear Regressions	19
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size	19
Explicit Two-Deletion Codes With Redundancy Matching the Existential Bound	18
Subexponential and Linear Subpacketization Coded Caching via Projective Geometry	18
Parallel Multilevel Constructions for Constant Dimension Codes	18
Convergence of Smoothed Empirical Measures With Applications to Entropy Estimation	18
Real-Time Reconstruction of a Counting Process Through First-Come-First-Serve Queue Systems	18
Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs	18
Distributed Multi-User Secret Sharing	18
Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis	18
Fundamental Limits of Combinatorial Multi-Access Caching	18
Reconstruction Codes for DNA Sequences With Uniform Tandem-Duplication Errors	18
On the Asymptotic Capacity of X-Secure T-Private Information Retrieval With Graph-Based Replicated Storage	18
Cascade Codes for Distributed Storage Systems	17
Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields	17
Construction of Constant Dimension Subspace Codes by Modifying Linkage Construction	17
Random Access Channel Coding in the Finite Blocklength Regime	17
Optimal Streaming Erasure Codes Over the Three-Node Relay Network	17
Fundamental Limits of Decentralized Data Shuffling	17
Parallel Device-Independent Quantum Key Distribution	17
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes	17
Sparse and Low-Rank Tensor Estimation via Cubic Sketchings	17
Semantic Private Information Retrieval	17
Memory AMP	17
On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets	17
Geometric Lower Bounds for Distributed Parameter Estimation Under Communication Constraints	17
Lightweight Authentication for Quantum Key Distribution	17
X-Secure T-Private Federated Submodel Learning With Elastic Dropout Resilience	16
Explicit Constructions of MDS Self-Dual Codes	16
Provably Secure Group Signature Schemes From Code-Based Assumptions	16
Private Set Intersection: A Multi-Message Symmetric Private Information Retrieval Perspective	16
A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields	16
Cumulative Residual and Relative Cumulative Residual Fisher Information and Their Properties	16
Efficient and Robust Distributed Matrix Computations via Convolutional Coding	16
How to Construct Mutually Orthogonal Complementary Sets With Non-Power-of-Two Lengths?	16
Information-Theoretic and Algorithmic Thresholds for Group Testing	16
The c-Differential Uniformity and Boomerang Uniformity of Two Classes of Permutation Polynomials	15
Secrecy by Design With Applications to Privacy and Compression	15
Fundamental Properties of Sum-Rank-Metric Codes	15
On the Stable Resolution Limit of Total Variation Regularization for Spike Deconvolution	15

An Algebraic-Geometric Approach for Linear Regression Without Correspondences	15
Non-Asymptotic Classical Data Compression With Quantum Side Information	15
New Instances of Quadratic APN Functions	15
Capacity of Broadcast Packet Erasure Channels With Single-User Delayed CSI	15
Generalized Linkage Construction for Constant-Dimension Codes	15
CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplication	15
Optimal Few-Weight Codes From Simplicial Complexes	15
Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry	15
Inference Under Information Constraints II: Communication Constraints and Shared Randomness	15
Signature Codes for Weighted Binary Adder Channel and Multimedia Fingerprinting	15
Partially Smoothed Information Measures	15
Blind Phaseless Short-Time Fourier Transform Recovery	15
The q-Ary Antiprimitive BCH Codes	15
The Asymptotic Capacity of Private Search	15
Large Deviations Behavior of the Logarithmic Error Probability of Random Codes	15
Spectral State Compression of Markov Processes	15
A Theory of Computational Resolution Limit for Line Spectral Estimation	14
Minimax Optimal Estimation of KL Divergence for Continuous Distributions	14
Multiclass Classification by Sparse Multinomial Logistic Regression	14
Motif and Hypergraph Correlation Clustering	14
Numerically Stable Coded Matrix Computations via Circulant and Rotation Matrix Embeddings	14
Impact of Action-Dependent State and Channel Feedback on Gaussian Wiretap Channels	14
On Permutation Quadrinomials and 4-Uniform BCT	14
Free Ride on LDPC Coded Transmission	14
The Global Optimization Geometry of Low-Rank Matrix Optimization	14
Divergence Radii and the Strong Converse Exponent of Classical-Quantum Channel Coding With Constant Compositions	14
Coded Distributed Computing With Partial Recovery	14
Sparse Composite Quantile Regression in Ultrahigh Dimensions With Tuning Parameter Calibration	14
On Linear Codes With One-Dimensional Euclidean Hull and Their Applications to EAQECCs	14
New MDS Euclidean Self-Orthogonal Codes	14
On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval	14
Deterministic Identification Over Channels With Power Constraints	14
Twisted Reed–Solomon Codes	14
Two Families of Optimal Linear Codes and Their Subfield Codes	13
When Are Fuzzy Extractors Possible?	13
Efficient and Explicit Balanced Primer Codes	13
Gaussian Multiple and Random Access Channels: Finite-Blocklength Analysis	13
A Scheme for Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths: Applications to Reed–Solomon, BCH, and Quadratic Residue Codes	13
Capacity of Quantum Private Information Retrieval With Multiple Servers	13
Estimation in Poisson Noise: Properties of the Conditional Mean Estimator	13
Secure Distributed Matrix Computation With Discrete Fourier Transform	13
Short Minimal Codes and Covering Codes via Strong Blocking Sets in Projective Spaces	13
Trace Reconstruction Problems in Computational Biology	13
CRC-Aided List Decoding of Convolutional Codes in the Short Blocklength Regime	13
Provable Low Rank Phase Retrieval	13
Computing Quantum Channel Capacities	13
Coding for Sequence Reconstruction for Single Edits	13
Resolving the Feedback Bottleneck of Multi-Antenna Coded Caching	13
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction	13
Multi-Armed Bandits With Correlated Arms	13
Array Codes With Local Properties	13
Coding Theorems for Noisy Permutation Channels	13
Nonconvex Rectangular Matrix Completion via Gradient Descent Without ℓ₂,∞ Regularization	13
Analysis of KNN Information Estimators for Smooth Distributions	12
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design	12
Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding	12
Constructions of Optimal Uniform Wide-Gap Frequency-Hopping Sequences	12
Linear Coded Caching Scheme for Centralized Networks	12
Interleaved Polar (I-Polar) Codes	12
An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures	12
Distributed Hypothesis Testing Based on Unequal-Error Protection Codes	12
Enabling Optimal Access and Error Correction for the Repair of Reed–Solomon Codes	12
A New Method for Searching Optimal Differential and Linear Trails in ARX Ciphers	12
On Coding Over Sliced Information	12
Error Exponents of Typical Random Trellis Codes	12
Entanglement-Assisted Quantum Codes From Algebraic Geometry Codes	12
The Generalized Lasso for Sub-Gaussian Measurements With Dithered Quantization	12
Quantum Channel State Masking	12
Deconstructing Generative Adversarial Networks	12
Entropy and Relative Entropy From Information-Theoretic Principles	12
Single-Error Detection and Correction for Duplication and Substitution Channels	12
Optimal Spectral Shrinkage and PCA With Heteroscedastic Noise	12
Constructions of Optimal Codes With Hierarchical Locality	12
A Cramér-Rao Lower Bound Derivation for Passive Sonar Track-Before-Detect Algorithms	12
Toward an Extremal Network Theory—Robust GDoF Gain of Transmitter Cooperation Over TIN	12
On Hulls of Some Primitive BCH Codes and Self-Orthogonal Codes	12
Encoder-Assisted Communications Over Additive Noise Channels	12
A Deterministic Theory of Low Rank Matrix Completion	12
Optimal Binary Linear Codes From Maximal Arcs	12
Circuit Knitting With Classical Communication	12
Multilevel-Coded Pulse-Position Modulation for Covert Communications Over Binary-Input Discrete Memoryless Channels	12
On Linearly Precoded Rate Splitting for Gaussian MIMO Broadcast Channels	11
Second-Order Asymptotics of Sequential Hypothesis Testing	11
Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources	11
Epsilon-Nets, Unitary Designs, and Random Quantum Circuits	11
Data Encoding for Byzantine-Resilient Distributed Optimization	11
On the Commitment Capacity of Unfair Noisy Channels	11
Teaching and Learning in Uncertainty	11
Quantum CDMA Communication Systems	11
New Construction of Optimal Type-II Binary Z-Complementary Pairs	11
On the Separability of Parallel MISO Broadcast Channels Under Partial CSIT: A Degrees of Freedom Region Perspective	11
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric	11
Quantized Compressed Sensing by Rectified Linear Units	11
Close Encounters of the Binary Kind: Signal Reconstruction Guarantees for Compressive Hadamard Sampling With Haar Wavelet Basis	11
A Single-Letter Upper Bound to the Mismatch Capacity	11