IEEE Transactions on Information Theory

Article	Citations
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm	294
Proceedings of the IEEE	194
Table of Contents	106
Table of Contents	103
Error Exponents in the Bee Identification Problem	101
Template Matching and Change Point Detection by M-Estimation	90
The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields	89
Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors	87
Random Periodic Sampling Patterns for Shift-Invariant Spaces	70
Federated Best Arm Identification With Heterogeneous Clients	65
Max-Linear Regression by Convex Programming	64
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help	59
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets	56
Fundamental Limits of Reference-Based Sequence Reordering	54
Recoverable Systems	48
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile	47
Dimension-Free Noninteractive Simulation From Gaussian Sources	47
Information Rates Over Multi-View Channels	46
IEEE Transactions on Information Theory Publication Information	40
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints	39
Discrete Signaling and Treating Interference as Noise for the Gaussian Interference Channel	37
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation	37
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map	37
Communicating Over a Classical-Quantum MAC With State Information Distributed at the Senders	36
IEEE Transactions on Information Theory Information for Authors	35

Breaking and Improving a Lattice-Code-Based Cryptosystem by Li, Ling, Xing, and Yeo	34
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information	33
Structural Complexity of One-Dimensional Random Geometric Graphs	33
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha	32
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography	32
A Locality-Based Lens for Coded Computation	31
Fast Correlation Attacks on K2 Stream Cipher	31
Tsallis and Rényi Deformations Linked via a New λ-Duality	30
Sharp Variance-Entropy Comparison for Nonnegative Gaussian Quadratic Forms	30
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality	30
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)	29
Exact Recovery in the General Hypergraph Stochastic Block Model	29
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes	29
Minimal Binary Linear Codes From Vectorial Boolean Functions	29
Secure Codes With List Decoding	28
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes	28
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements	28
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target	28
IEEE Transactions on Information Theory information for authors	28
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints	28
IEEE Transactions on Information Theory Information for Authors	28
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature	27
Guesswork With Quantum Side Information	27
Computing Efficiently a Parity-Check Matrix for ℤ p s -Additive Codes	27
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning	27
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks	26
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification	26
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions	26
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles	26
The Algebraic Characterization of ℳ-Subspaces of Bent Concatenations and Its Application	26
Encoding Classical Information Into Quantum Resources	26
Log-Concave Sequences in Coding Theory	25
Matroidal Entropy Functions: Constructions, Characterizations, and Representations	25
Improved Random-Binning Exponent for Distributed Hypothesis Testing	25
A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction	25
An Automated Theorem Proving Framework for Information-Theoretic Results	24
The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes	24
Normalized Delivery Time of Wireless MapReduce	24
Table of Contents	24
A Variational Principle for the Metric Mean Dimension of Level Sets	23
Rethinking Hard Thresholding Pursuit: Full Adaptation and Sharp Estimation	23
Error-Correction for Sparse Support Recovery Algorithms	23
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities	23
Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties	22
The Number of Nonequivalent Monotone Boolean Functions of 8 Variables	22
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement	22
The Generations of Classical Correlations via Quantum Schemes	22
List-Decoding of AG Codes Without Genus Penalty	22
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel	22
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology	22

Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”	22
Encoder Blind Combinatorial Compressed Sensing	22
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp	22
Distributed Compression of Graphical Data	21
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables	21
Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited	21
Limitations on Transversal Gates for Hypergraph Product Codes	21
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction	21
Covering Radius of Melas Codes	20
Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming	20
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities	20
Derandomizing Codes for the Adversarial Wiretap Channel of Type II	20
Information-Theoretic Thresholds for Planted Dense Cycles	20
ARMA Processes With Discrete-Continuous Excitation: Compressibility Beyond Sparsity	20
An Algorithmic Reduction Theory for Binary Codes: LLL and More	20
Improved Fast Correlation Attack Using Multiple Linear Approximations and Its Application on SOSEMANUK	20
The Platypus of the Quantum Channel Zoo	20
IEEE Transactions on Information Theory Information for Authors	20
Private Inference in Quantized Models	20
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set	20
Unextendible Entanglement of Quantum Channels	20
Quantum Differentially Private Sparse Regression Learning	19
Memory AMP	19
Table of Contents	19
On the Cost of Consecutive Estimation Error: Significance-Aware Non-Linear Aging	19
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm	19
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes	19
On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions	19
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k	19
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically	19
Balanced Product Quantum Codes	19
IEEE Transactions on Information Theory publication information	18
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover	18
Minimax Optimal Q Learning With Nearest Neighbors	18
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy	18
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach	18
Zero-Error Capacity of the Chemical Residual Channel	18
Universality Laws for High-Dimensional Learning With Random Features	18
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys	18
Bounds on MLDR Codes Over ???? pt	18
SPARCs for Unsourced Random Access	18
Improved Support Recovery in Universal 1-bit Compressed Sensing	18
Wei’s Duality for Generalized Poset Weight over Galois Rings	18
On Penalization in Stochastic Multi-Armed Bandits	17
Reliability Function for Streaming Over a DMC With Feedback	17
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications	17
Tree Density Estimation	17
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment	17
Private Noisy Side Information Helps to Increase the Capacity of SPIR	17
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances	17
Schrödinger-Föllmer Sampler	17
Two-Way Source-Channel Coding	17
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures	17
Asymptotic Bounds on the Rate of Locally Repairable Codes	16
IEEE Transactions on Information Theory Publication Information	16
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy	16
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning Using Passive Langevin Dynamics	16
Generalized Singleton Type Upper Bounds	16
Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions	16
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations	16
Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes	16
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation	16
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements	16
Streaming Codes for Variable-Size Messages	16
A Deterministic Algorithm for the Capacity of Finite-State Channels	16
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise	16
Minimax Off-Policy Evaluation for Multi-Armed Bandits	16
Flexible Distributed Matrix Multiplication	16
Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks	16
A Refinement of Expurgation	16
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes	16
Quantum Coordination Rates in Multi-User Networks	15
Neural Estimation and Optimization of Directed Information Over Continuous Spaces	15
Test-Measured Rényi Divergences	15
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization	15
On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of Information	15
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers	15
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric	15
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes	15
Learning From Heterogeneous Data Based on Social Interactions Over Graphs	15

MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes	15
Bounds on Covert Capacity With Sub-Exponential Random Slot Selection	15
Higher-Order Staircase Codes	15
Window-Limited CUSUM for Sequential Change Detection	15
Virtual Quantum Markov Chains	15
Concatenated Codes for Multiple Reads of a DNA Sequence	15
An Information-Theoretic Framework for Out-of-Distribution Generalization with Applications to Stochastic Gradient Langevin Dynamics	15
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications	15
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches	15
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes	15
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data	14
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms	14
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements	14
Gram–Schmidt Methods for Unsupervised Feature Extraction and Selection	14
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	14
The Hermitian Dual Codes of Several Classes of BCH Codes	14
Unsourced Multiple Access With Random User Activity	14
On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model	14
On Recovery of Sparse Signals With Prior Support Information via Weighted ℓₚ-Minimization	13
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns	13
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design	13
IEEE Transactions on Information Theory Publication Information	13
Characterizing the Functional Density Power Divergence Class	13
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields	13
Limit Distribution Theory for f-Divergences	13
On Sampling Continuous-Time AWGN Channels	13
Symplectic Self-Orthogonal Quasi-Cyclic Codes	13
Griesmer Type Bounds for Nonlinear Codes and Their Applications	13
Constant L₁-Weight Codes Under L∞-Metric	13
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes	13
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel	13
Invertible Low-Divergence Coding	13
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder	13
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing	13
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models	13
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames	13
Typicality for Stratified Measures	13
Conditional Independence Structures Over Four Discrete Random Variables Revisited: Conditional Ingleton Inequalities	13
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel	12
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances	12
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes	12
Quantum Multiple-Access One-Time Pad	12
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing	12
Non-Reed-Solomon Type Cyclic MDS Codes	12
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around	12
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model	12
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access	12
Quantum Ruzsa Divergence to Quantify Magic	12
On L 2-Consistency of Nearest Neighbor Matching	12
Node Repair on Connected Graphs	12
Entropic Compressibility of Lévy Processes	12
Free Ride on LDPC Coded Transmission	12
Table of Contents	12
Universal Graph Compression: Stochastic Block Models	12
The First Achievement of a Given Level by a Random Process	12
Sensitivity Analysis for Binary Sampling Systems via Quantitative Fisher Information Lower Bounds	12
The Isometry-Dual Property in Flags of Two-Point Algebraic Geometry Codes	12
Codes Correcting Two Bursts of Exactly b Deletions	12
Decoding Reed–Solomon Skew-Differential Codes	12
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity	12
Information-Theoretic Analysis of Minimax Excess Risk	12
Exponential Savings in Agnostic Active Learning Through Abstention	12
From Letters to Words and Back: Invertible Coding of Stationary Measures	12
Rate-Distortion-Perception Theory for the Quadratic Wasserstein Space	11
Generic Decoding in the Sum-Rank Metric	11
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels	11
On the Best Lattice Quantizers	11
On de Bruijn Array Codes—Part I: Nonlinear Codes	11
Multi-Armed Bandits With Correlated Arms	11
Divergence Estimation in Message Passing Algorithms	11
Codes Over Absorption Channels	11
Clustering-Correcting Codes	11
Sketching Semidefinite Programs for Faster Clustering	11
Two-Insertion/Deletion/Substitution Correcting Codes	11
Provable Tradeoffs in Adversarially Robust Classification	11
Maximum-Order Complexity and 2-Adic Complexity	11
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods	11
Retrieving Data Permutations From Noisy Observations: Asymptotics	11
Combinatorial-Probabilistic Trade-Off: P-Values of Community Property Test in the Stochastic Block Models	11
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning	11
MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction	11
Minimax Converse for Identification via Channels	11
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission	11
Mitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers	11
Privacy Amplification and Decoupling Without Smoothing	11
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays	11
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity	11
Active Sampling for the Quickest Detection of Markov Networks	11
Optimal 1-bit Error Exponent for 2-Hop Relaying With Binary-Input Channels	11
Self-Orthogonal Codes From p-Divisible Codes	11
Table of Contents	11
Quadratic Privacy-Signaling Games and the MMSE Information Bottleneck Problem for Gaussian Sources	10
Nonparametric Two-Sample Testing by Betting	10
DNA-Correcting Codes: End-to-End Correction in DNA Storage Systems	10
Space Complexity of Euclidean Clustering	10