IEEE Transactions on Information Theory

Article	Citations
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm	238
Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding	153
Proceedings of the IEEE	92
Table of Contents	91
Tsallis and Rényi Deformations Linked via a New λ-Duality	90
Table of Contents	90
Communication Complexity of Distributed High Dimensional Correlation Testing	80
Error Exponents in the Bee Identification Problem	71
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case	68
Polar Lattices for Lossy Compression	68
Template Matching and Change Point Detection by M-Estimation	59
The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields	57
Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors	54
Random Periodic Sampling Patterns for Shift-Invariant Spaces	52
Federated Best Arm Identification With Heterogeneous Clients	47
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets	43
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help	43
Max-Linear Regression by Convex Programming	43
Recoverable Systems	41
Fundamental Limits of Reference-Based Sequence Reordering	41
Dimension-Free Noninteractive Simulation From Gaussian Sources	40
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile	39
Communicating over a Classical-Quantum MAC with State Information Distributed at the Senders	36
Structural Complexity of One-Dimensional Random Geometric Graphs	35
IEEE Transactions on Information Theory Publication Information	35

Information Rates Over Multi-View Channels	35
Minimal Binary Linear Codes From Vectorial Boolean Functions	34
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map	34
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints	34
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation	33
Discrete Signaling and Treating Interference as Noise for the Gaussian Interference Channel	33
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information	31
IEEE Transactions on Information Theory Information for Authors	31
Exact Recovery in the General Hypergraph Stochastic Block Model	30
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha	30
Fast Correlation Attacks on K2 Stream Cipher	30
Covert Identification Over Binary-Input Discrete Memoryless Channels	30
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography	30
A Locality-Based Lens for Coded Computation	29
Breaking and improving a lattice-code-based cryptosystem by Li, Ling, Xing and Yeo	29
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)	29
Sharp Variance-Entropy Comparison for Nonnegative Gaussian Quadratic Forms	29
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality	28
Construction of MDS Euclidean Self-Dual Codes via Two Subsets	28
IEEE Transactions on Information Theory information for authors	28
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements	28
IEEE Transactions on Information Theory Information for Authors	28
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm	27
Quantum Differentially Private Sparse Regression Learning	27
Learning Mixtures of Low-Rank Models	26
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes	26
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints	26
On the Number of Affine Equivalence Classes of Boolean Functions and q-Ary Functions	26
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification	26
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target	25
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning	25
A Variational Principle for the Metric Mean Dimension of Level Sets	25
Cooperative Multiple-Access Channels With Distributed State Information	25
Secure Codes With List Decoding	25
Guesswork With Quantum Side Information	25
On the Communication Complexity of AND Functions	25
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature	25
Unextendible entanglement of quantum channels	24
Linear-Time Erasure List-Decoding of Expander Codes	24
ARMA Processes with Discrete-Continuous Excitation: Compressibility Beyond Sparsity	24
The Algebraic Characterization of ℳ-Subspaces of Bent Concatenations and Its Application	24
A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction	24
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks	24
Computing Efficiently a Parity-Check Matrix for ℤ p s -Additive Codes	24
Matroidal Entropy Functions: Constructions, Characterizations, and Representations	23
Table of Contents	23
Normalized Delivery Time of Wireless MapReduce	23
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles	23
An Automated Theorem Proving Framework for Information-Theoretic Results	23
Error-Correction for Sparse Support Recovery Algorithms	22

Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties	22
List-Decoding of AG Codes Without Genus Penalty	22
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities	22
The Number of Nonequivalent Monotone Boolean Functions of 8 Variables	22
Encoder Blind Combinatorial Compressed Sensing	22
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically	22
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set	22
Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”	22
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement	21
The Generations of Classical Correlations via Quantum Schemes	21
Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited	21
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel	21
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology	21
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp	21
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction	21
The Platypus of the Quantum Channel Zoo	20
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables	20
Private Inference in Quantized Models	20
Encoding Classical Information Into Quantum Resources	20
Limitations on Transversal Gates for Hypergraph Product Codes	20
Memory AMP	20
Covering Radius of Melas Codes	20
Distributed Compression of Graphical Data	20
On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions	19
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions	19
Derandomizing Codes for the Adversarial Wiretap Channel of Type II	19
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k	19
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities	19
An Algorithmic Reduction Theory for Binary Codes: LLL and More	19
IEEE Transactions on Information Theory Information for Authors	19
Information-Theoretic Thresholds for Planted Dense Cycles	19
Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming	19
Improved Fast Correlation Attack Using Multiple Linear Approximations and Its Application on SOSEMANUK	19
Balanced Product Quantum Codes	18
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms	18
Neural Estimation and Optimization of Directed Information Over Continuous Spaces	18
Bounds on MLDR Codes Over Z p t	18
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover	18
On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of Information	18
Quasi-Orthogonal Z-Complementary Pairs and Their Applications in Fully Polarimetric Radar Systems	18
Zero-Error Capacity of the Chemical Residual Channel	18
SPARCs for Unsourced Random Access	18
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances	18
Table of Contents	18
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes	18
Coordination Through Shared Randomness	18
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric	18
Higher-Order Staircase Codes	17
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization	17
Reliability Function for Streaming Over a DMC With Feedback	17
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment	17
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys	17
Tree Density Estimation	17
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures	17
IEEE Transactions on Information Theory publication information	17
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes	17
Schrödinger-Föllmer Sampler	17
On Penalization in Stochastic Multi-Armed Bandits	17
Generalized Singleton Type Upper Bounds	16
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications	16
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements	16
The Hermitian Dual Codes of Several Classes of BCH Codes	16
Private Noisy Side Information Helps to Increase the Capacity of SPIR	16
Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions	16
A Refinement of Expurgation	16
Two-Way Source-Channel Coding	16
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise	16
Learning From Heterogeneous Data Based on Social Interactions Over Graphs	16
Asymptotic Bounds on the Rate of Locally Repairable Codes	16
A Deterministic Algorithm for the Capacity of Finite-State Channels	16
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers	16
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications	16
A New Achievable Rate-Distortion Region for Distributed Source Coding	16
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets	16
Streaming Codes for Variable-Size Messages	16
Minimax Off-Policy Evaluation for Multi-Armed Bandits	15
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements	15
Unsourced Multiple Access With Random User Activity	15
Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks	15
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach	15

Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes	15
IEEE Transactions on Information Theory Publication Information	15
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data	15
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning Using Passive Langevin Dynamics	15
Minimax Optimal Q Learning With Nearest Neighbors	15
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations	15
Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes	15
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy	15
Quantum Coordination Rates in Multi-User Networks	15
Quantum Ruzsa Divergence to Quantify Magic	14
Improved Support Recovery in Universal 1-bit Compressed Sensing	14
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models	14
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes	14
Test-Measured Rényi Divergences	14
Universality Laws for High-Dimensional Learning With Random Features	14
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy	14
Griesmer Type Bounds for Nonlinear Codes and Their Applications	14
Flexible Distributed Matrix Multiplication	14
Virtual Quantum Markov Chains	14
Concatenated Codes for Multiple Reads of a DNA Sequence	14
On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model	14
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design	14
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation	14
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing	14
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes	14
Window-Limited CUSUM for Sequential Change Detection	14
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	14
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches	14
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields	13
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity	13
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames	13
Uncertainty of Reconstruction With List-Decoding From Uniform-Tandem-Duplication Noise	13
Typicality for Stratified Measures	13
On Sampling Continuous-Time AWGN Channels	13
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder	13
Information-Theoretic Analysis of Minimax Excess Risk	13
Constant L₁-Weight Codes Under L∞-Metric	13
IEEE Transactions on Information Theory Publication Information	13
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel	13
Invertible Low-Divergence Coding	13
Limit Distribution Theory for f-Divergences	13
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing	13
Quantum Multiple-Access One-Time Pad	13
Entropic Compressibility of Lévy Processes	13
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays	13
Conditional Independence Structures Over Four Discrete Random Variables Revisited: Conditional Ingleton Inequalities	13
On Recovery of Sparse Signals With Prior Support Information via Weighted ℓₚ-Minimization	13
The Isometry-Dual Property in Flags of Two-Point Algebraic Geometry Codes	13
Multi-Armed Bandits With Correlated Arms	12
Non-Reed-Solomon Type Cyclic MDS Codes	12
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes	12
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns	12
Characterizing the Functional Density Power Divergence Class	12
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances	12
Minimax Converse for Identification via Channels	12
On the Best Lattice Quantizers	12
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity	12
Symplectic Self-Orthogonal Quasi-Cyclic Codes	12
On L 2-Consistency of Nearest Neighbor Matching	12
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission	12
Table of Contents	12
Exponential Savings in Agnostic Active Learning Through Abstention	12
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels	12
On de Bruijn Array Codes—Part I: Nonlinear Codes	12
Sensitivity Analysis for Binary Sampling Systems via Quantitative Fisher Information Lower Bounds	12
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel	11
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes	11
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around	11
Quasi-Cyclic Perfect Codes in Doob Graphs and Special Partitions of Galois Rings	11
Optimal 1-bit Error Exponent for 2-Hop Relaying With Binary-Input Channels	11
Free Ride on LDPC Coded Transmission	11
Decoding Reed–Solomon Skew-Differential Codes	11
Generic Decoding in the Sum-Rank Metric	11
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model	11
Universal Graph Compression: Stochastic Block Models	11
Linearly Self-Equivalent APN Permutations in Small Dimension	11
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation	11
Active Sampling for the Quickest Detection of Markov Networks	11
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors	11
Combinatorial-Probabilistic Trade-Off: P-Values of Community Property Test in the Stochastic Block Models	11
Self-Orthogonal Codes From p-Divisible Codes	11
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods	11
Clustering-Correcting Codes	11
Privacy Amplification and Decoupling Without Smoothing	11
Provable Tradeoffs in Adversarially Robust Classification	11
Mitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers	11
Sketching Semidefinite Programs for Faster Clustering	11
Divergence Estimation in Message Passing Algorithms	11
Optimal Locally Repairable Codes: An Improved Bound and Constructions	11
Table of Contents	11
MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction	11
Entanglement Cost of Discriminating Quantum States Under Locality Constraints	11
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning	11
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access	11
Maximum-Order Complexity and 2-Adic Complexity	11