IEEE Transactions on Information Theory

Article	Citations
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm	259
Proceedings of the IEEE	161
Table of Contents	96
Table of Contents	93
Communication Complexity of Distributed High Dimensional Correlation Testing	92
Error Exponents in the Bee Identification Problem	90
Polar Lattices for Lossy Compression	81
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case	72
Template Matching and Change Point Detection by M-Estimation	69
The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields	60
Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors	57
Random Periodic Sampling Patterns for Shift-Invariant Spaces	56
Federated Best Arm Identification With Heterogeneous Clients	54
Max-Linear Regression by Convex Programming	49
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets	44
Recoverable Systems	44
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help	44
Fundamental Limits of Reference-Based Sequence Reordering	44
Dimension-Free Noninteractive Simulation From Gaussian Sources	43
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile	41
Information Rates Over Multi-View Channels	37
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation	36
IEEE Transactions on Information Theory Publication Information	36
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map	36
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints	36

Discrete Signaling and Treating Interference as Noise for the Gaussian Interference Channel	35
Minimal Binary Linear Codes From Vectorial Boolean Functions	34
IEEE Transactions on Information Theory Information for Authors	33
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)	32
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information	31
Structural Complexity of One-Dimensional Random Geometric Graphs	31
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography	30
A Locality-Based Lens for Coded Computation	30
Fast Correlation Attacks on K2 Stream Cipher	30
Breaking and improving a lattice-code-based cryptosystem by Li, Ling, Xing and Yeo	30
Covert Identification Over Binary-Input Discrete Memoryless Channels	30
Sharp Variance-Entropy Comparison for Nonnegative Gaussian Quadratic Forms	30
Tsallis and Rényi Deformations Linked via a New λ-Duality	29
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality	29
Exact Recovery in the General Hypergraph Stochastic Block Model	29
Construction of MDS Euclidean Self-Dual Codes via Two Subsets	29
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha	27
Communicating Over a Classical-Quantum MAC With State Information Distributed at the Senders	27
Improved Decoding Algorithms for MDS and Almost-MDS Codes from Twisted GRS Codes	27
IEEE Transactions on Information Theory Information for Authors	26
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification	26
IEEE Transactions on Information Theory information for authors	26
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm	26
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes	26
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements	26
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints	26
Secure Codes With List Decoding	25
On the Number of Affine Equivalence Classes of Boolean Functions and q-Ary Functions	25
Guesswork With Quantum Side Information	25
Cooperative Multiple-Access Channels With Distributed State Information	25
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning	25
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target	25
The Algebraic Characterization of ℳ-Subspaces of Bent Concatenations and Its Application	24
On the Cost of Consecutive Estimation Error: Significance-Aware Non-linear Aging	24
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks	24
A Variational Principle for the Metric Mean Dimension of Level Sets	24
Linear-Time Erasure List-Decoding of Expander Codes	24
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions	24
Computing Efficiently a Parity-Check Matrix for ℤ p s -Additive Codes	24
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature	24
A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction	24
Matroidal Entropy Functions: Constructions, Characterizations, and Representations	23
Table of Contents	23
An Automated Theorem Proving Framework for Information-Theoretic Results	23
Normalized Delivery Time of Wireless MapReduce	23
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
Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”	22

Error-Correction for Sparse Support Recovery Algorithms	22
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles	22
Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties	22
List-Decoding of AG Codes Without Genus Penalty	22
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement	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
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction	21
The Generations of Classical Correlations via Quantum Schemes	21
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp	21
Limitations on Transversal Gates for Hypergraph Product Codes	20
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities	20
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k	20
Improved Fast Correlation Attack Using Multiple Linear Approximations and Its Application on SOSEMANUK	20
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables	20
Private Inference in Quantized Models	20
Information-Theoretic Thresholds for Planted Dense Cycles	20
Distributed Compression of Graphical Data	20
Memory AMP	20
Derandomizing Codes for the Adversarial Wiretap Channel of Type II	20
IEEE Transactions on Information Theory Information for Authors	20
Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming	19
The b-symbol Hamming weight spectra of quaternary Kerdock codes and related codes	19
An Algorithmic Reduction Theory for Binary Codes: LLL and More	19
Encoding Classical Information Into Quantum Resources	19
On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions	19
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes	19
SPARCs for Unsourced Random Access	18
Unextendible Entanglement of Quantum Channels	18
The Platypus of the Quantum Channel Zoo	18
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set	18
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms	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
Balanced Product Quantum Codes	18
Quantum Differentially Private Sparse Regression Learning	18
Table of Contents	18
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric	18
Zero-Error Capacity of the Chemical Residual Channel	18
ARMA Processes With Discrete-Continuous Excitation: Compressibility Beyond Sparsity	18
Covering Radius of Melas Codes	18
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances	18
Coordination Through Shared Randomness	18
Neural Estimation and Optimization of Directed Information Over Continuous Spaces	17
Window-Limited CUSUM for Sequential Change Detection	17
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	17
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment	17
Learning From Heterogeneous Data Based on Social Interactions Over Graphs	17
Test-Measured Rényi Divergences	17
Bounds on MLDR Codes Over ???? pt	17
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach	17
Concatenated Codes for Multiple Reads of a DNA Sequence	17
Schrödinger-Föllmer Sampler	16
Capacity Approaching Coding for Low Noise Interactive Quantum Communication Part I: Large Alphabets	16
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications	16
IEEE Transactions on Information Theory publication information	16
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes	16
Tree Density Estimation	16
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements	16
Private Noisy Side Information Helps to Increase the Capacity of SPIR	16
Higher-Order Staircase Codes	16
On Penalization in Stochastic Multi-Armed Bandits	16
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures	16
Two-Way Source-Channel Coding	16
Reliability Function for Streaming Over a DMC With Feedback	16
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization	16
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys	16
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise	15
A Deterministic Algorithm for the Capacity of Finite-State Channels	15
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers	15
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements	15
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data	15
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications	15
Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions	15
Generalized Singleton Type Upper Bounds	15
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes	15
IEEE Transactions on Information Theory Publication Information	15
Minimax Off-Policy Evaluation for Multi-Armed Bandits	15
Streaming Codes for Variable-Size Messages	15

Asymptotic Bounds on the Rate of Locally Repairable Codes	15
A Refinement of Expurgation	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
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes	14
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes	14
Universality Laws for High-Dimensional Learning With Random Features	14
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches	14
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning Using Passive Langevin Dynamics	14
Improved Support Recovery in Universal 1-bit Compressed Sensing	14
Virtual Quantum Markov Chains	14
Flexible Distributed Matrix Multiplication	14
The Hermitian Dual Codes of Several Classes of BCH Codes	14
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation	14
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy	14
Quantum Coordination Rates in Multi-User Networks	14
Unsourced Multiple Access With Random User Activity	14
On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model	14
Minimax Optimal Q Learning With Nearest Neighbors	14
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design	14
Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks	14
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy	14
Quantum Ruzsa Divergence to Quantify Magic	13
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel	13
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing	13
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity	13
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns	13
On Sampling Continuous-Time AWGN Channels	13
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames	13
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models	13
IEEE Transactions on Information Theory Publication Information	13
Typicality for Stratified Measures	13
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder	13
On Recovery of Sparse Signals With Prior Support Information via Weighted ℓₚ-Minimization	13
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields	13
Constant L₁-Weight Codes Under L∞-Metric	13
Griesmer Type Bounds for Nonlinear Codes and Their Applications	13
Conditional Independence Structures Over Four Discrete Random Variables Revisited: Conditional Ingleton Inequalities	13
Sensitivity Analysis for Binary Sampling Systems via Quantitative Fisher Information Lower Bounds	13
Limit Distribution Theory for f-Divergences	13
Invertible Low-Divergence Coding	13
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays	13
Characterizing the Functional Density Power Divergence Class	12
Symplectic Self-Orthogonal Quasi-Cyclic Codes	12
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel	12
Exponential Savings in Agnostic Active Learning Through Abstention	12
Multi-Armed Bandits With Correlated Arms	12
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning	12
Free Ride on LDPC Coded Transmission	12
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes	12
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around	12
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods	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 de Bruijn Array Codes—Part I: Nonlinear Codes	12
On L 2-Consistency of Nearest Neighbor Matching	12
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes	12
Privacy Amplification and Decoupling Without Smoothing	12
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission	12
Table of Contents	12
Optimal 1-bit Error Exponent for 2-Hop Relaying With Binary-Input Channels	11
Combinatorial-Probabilistic Trade-Off: P-Values of Community Property Test in the Stochastic Block Models	11
On the Best Lattice Quantizers	11
The Isometry-Dual Property in Flags of Two-Point Algebraic Geometry Codes	11
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels	11
The First Achievement of a Given Level by a Random Process	11
From Letters to Words and Back: Invertible Coding of Stationary Measures	11
Some Punctured Codes of Several Families of Binary Linear Codes	11
Provable Tradeoffs in Adversarially Robust Classification	11
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model	11
Information-Theoretic Analysis of Minimax Excess Risk	11
Divergence Estimation in Message Passing Algorithms	11
Entanglement Cost of Discriminating Quantum States Under Locality Constraints	11
Decoding Reed–Solomon Skew-Differential Codes	11
Entropic Compressibility of Lévy Processes	11
Clustering-Correcting Codes	11
Node Repair on Connected Graphs	11
Generic Decoding in the Sum-Rank Metric	11
Two-Insertion/Deletion/Substitution Correcting Codes	11
Non-Reed-Solomon Type Cyclic MDS Codes	11
Quantum Multiple-Access One-Time Pad	11
Active Sampling for the Quickest Detection of Markov Networks	11
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing	11
Table of Contents	11
Self-Orthogonal Codes From p-Divisible Codes	11
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity	11
Mitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers	11
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access	11
Maximum-Order Complexity and 2-Adic Complexity	11
Universal Graph Compression: Stochastic Block Models	11
Sketching Semidefinite Programs for Faster Clustering	11
MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction	11
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation	11
On Estimating Rank-One Spiked Tensors in the Presence of Heavy Tailed Errors	10
On the Asymptotic Rate of Optimal Codes That Correct Tandem Duplications for Nanopore Sequencing	10