IEEE Transactions on Information Theory

Article	Citations
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm	213
Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding	170
Fast Correlation Attacks on K2 Stream Cipher	130
Proceedings of the IEEE	96
Table of Contents	88
Table of Contents	88
Tsallis and Rényi Deformations Linked via a New λ-Duality	82
Error Exponents in the Bee Identification Problem	81
Communication Complexity of Distributed High Dimensional Correlation Testing	81
Polar Lattices for Lossy Compression	78
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case	67
Discrete Signaling and Treating Interference as Noise for the Gaussian Interference Channel	64
Template Matching and Change Point Detection by M-Estimation	63
Sharp Variance-Entropy Comparison for Nonnegative Gaussian Quadratic Forms	61
The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields	58
Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors	57
Random Periodic Sampling Patterns for Shift-Invariant Spaces	50
Federated Best Arm Identification With Heterogeneous Clients	49
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography	47
Max-Linear Regression by Convex Programming	46
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help	46
Fundamental Limits of Reference-Based Sequence Reordering	44
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets	44
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation	41
Dimension-Free Noninteractive Simulation From Gaussian Sources	41

Recoverable Systems	41
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile	40
Communicating over a Classical-Quantum MAC with State Information Distributed at the Senders	39
Structural Complexity of One-Dimensional Random Geometric Graphs	38
Information Rates Over Multi-View Channels	38
IEEE Transactions on Information Theory Publication Information	37
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints	35
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map	34
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information	33
Minimal Binary Linear Codes From Vectorial Boolean Functions	33
Covert Identification Over Binary-Input Discrete Memoryless Channels	33
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
Construction of MDS Euclidean Self-Dual Codes via Two Subsets	32
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha	31
Exact Recovery in the General Hypergraph Stochastic Block Model	30
A locality-based lens for coded computation	30
Quantum Differentially Private Sparse Regression Learning	29
IEEE Transactions on Information Theory Information for Authors	29
IEEE Transactions on Information Theory information for authors	29
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements	29
IEEE Transactions on Information Theory publication information	29
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm	28
Polarization of Quantum Channels Using Clifford-Based Channel Combining	28
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification	28
Quasi-Orthogonal Z-Complementary Pairs and Their Applications in Fully Polarimetric Radar Systems	28
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes	28
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints	28
Efficient Multiparty Interactive Coding—Part I: Oblivious Insertions, Deletions and Substitutions	27
The Platypus of the Quantum Channel Zoo	27
Learning Mixtures of Low-Rank Models	27
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target	26
On the Number of Affine Equivalence Classes of Boolean Functions and q-Ary Functions	26
Cooperative Multiple-Access Channels With Distributed State Information	26
Guesswork With Quantum Side Information	25
Derandomizing Codes for the Adversarial Wiretap Channel of Type II	25
Secure Codes With List Decoding	25
On the Communication Complexity of AND Functions	25
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature	25
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning	25
Memory AMP	25
Quantized Compressed Sensing by Rectified Linear Units	24
Balanced Product Quantum Codes	24
Covering Radius of Melas Codes	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
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k	24
A Variational Principle for the Metric Mean Dimension of Level Sets	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	23

Linear-Time Erasure List-Decoding of Expander Codes	23
Matroidal Entropy Functions: Constructions, Characterizations, and Representations	23
An Automated Theorem Proving Framework for Information-Theoretic Results	22
Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming	22
Normalized Delivery Time of Wireless MapReduce	22
Communicating Correlated Sources Over MAC and Interference Channels II: Joint Source-Channel Coding	22
Table of Contents	22
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles	22
Encoder Blind Combinatorial Compressed Sensing	21
List-Decoding of AG Codes Without Genus Penalty	21
Error-Correction for Sparse Support Recovery Algorithms	21
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically	21
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities	21
Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”	21
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement	20
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set	20
The Number of Nonequivalent Monotone Boolean Functions of 8 Variables	20
The Generations of Classical Correlations via Quantum Schemes	20
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions	20
Information-Theoretic Thresholds for Planted Dense Cycles	20
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel	20
Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties	20
Encoding Classical Information Into Quantum Resources	19
An Algorithmic Reduction Theory for Binary Codes: LLL and More	19
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes	19
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp	19
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology	19
Distributed Compression of Graphical Data	19
Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited	19
Improved Fast Correlation Attack Using Multiple Linear Approximations and Its Application on SOSEMANUK	19
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction	19
Limitations on Transversal Gates for Hypergraph Product Codes	19
On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions	18
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy	18
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric	18
Neural Estimation and Optimization of Directed Information Over Continuous Spaces	18
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning using Passive Langevin Dynamics	18
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities	18
Table of Contents	18
Efficient Algorithms for Attributed Graph Alignment with Vanishing Edge Correlation	18
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy	18
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables	18
Private Inference in Quantized Models	18
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	18
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms	18
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes	18
Coordination Through Shared Randomness	17
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys	17
Table of contents	17
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover	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
Higher-Order Staircase Codes	17
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances	17
Zero-Error Capacity of the Chemical Residual Channel	17
Minimax Optimal Q Learning With Nearest Neighbors	17
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization	17
Test-Measured Rényi Divergences	17
Systematic Convolutional Low Density Generator Matrix Code	16
Reliability Function for Streaming Over a DMC With Feedback	16
Error Probability Bounds for Gaussian Channels Under Maximal and Average Power Constraints	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
Window-Limited CUSUM for Sequential Change Detection	16
SPARCs for Unsourced Random Access	16
The Hermitian Dual Codes of Several Classes of BCH Codes	16
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures	16
Schrödinger-Föllmer Sampler	16
A New Achievable Rate-Distortion Region for Distributed Source Coding	16
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements	16
Flexible Distributed Matrix Multiplication	16
On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of Information	16
Unsourced Multiple Access With Random User Activity	16
On Penalization in Stochastic Multi-Armed Bandits	16
On the Optimal Load-Memory Tradeoff of Cache-Aided Scalar Linear Function Retrieval	16
Tree Density Estimation	16
Two-Way Source-Channel Coding	16
Learning From Heterogeneous Data Based on Social Interactions Over Graphs	16
Quantum Coordination Rates in Multi-User Networks	16
Minimax Off-Policy Evaluation for Multi-Armed Bandits	15

Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations	15
A Refinement of Expurgation	15
Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions	15
Streaming Codes for Variable-Size Messages	15
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications	15
Improved Support Recovery in Universal 1-bit Compressed Sensing	15
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes	15
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements	15
Concatenated Codes for Multiple Reads of a DNA Sequence	15
Private Noisy Side Information Helps to Increase the Capacity of SPIR	15
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data	15
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers	15
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes	15
IEEE Transactions on Information Theory Publication Information	15
Asymptotic Bounds on the Rate of Locally Repairable Codes	15
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise	15
A Deterministic Algorithm for the Capacity of Finite-State Channels	15
Generalized Singleton Type Upper Bounds	15
Griesmer Type Bounds for Nonlinear Codes and Their Applications	14
IEEE Transactions on Information Theory Publication Information	14
Entropic Compressibility of Lévy Processes	14
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays	14
Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes	14
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design	14
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing	14
Constant L₁-Weight Codes Under L∞-Metric	14
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel	14
Universality Laws for High-Dimensional Learning With Random Features	14
Quantum Ruzsa Divergence to Quantify Magic	14
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models	14
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames	14
Node Repair on Connected Graphs	14
Provable Security Evaluations of XOR-versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks	14
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing	13
Geometric Approach tob-Symbol Hamming Weights of Cyclic Codes	13
Information-Theoretic Analysis of Minimax Excess Risk	13
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields	13
On Recovery of Sparse Signals With Prior Support Information via Weighted ℓₚ-Minimization	13
Universal Graph Compression: Stochastic Block Models	13
Invertible Low-Divergence Coding	13
Uncertainty of Reconstruction With List-Decoding From Uniform-Tandem-Duplication Noise	13
Linearly Self-Equivalent APN Permutations in Small Dimension	13
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity	13
Typicality for Stratified Measures	13
Free Ride on LDPC Coded Transmission	13
Limit Distribution Theory for f-Divergences	13
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around	13
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel	13
Quantum Multiple-Access One-Time Pad	13
Conditional Independence Structures Over Four Discrete Random Variables Revisited: Conditional Ingleton Inequalities	13
The Isometry-Dual Property in Flags of Two-Point Algebraic Geometry Codes	13
On Sampling Continuous-Time AWGN Channels	13
Clustering-Correcting Codes	13
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder	13
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes	12
Mitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers	12
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity	12
Multichannel Conflict-Avoiding Codes of Weights Three and Four	12
On de Bruijn Array Codes—Part I: Nonlinear Codes	12
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access	12
Maximum-Order Complexity and 2-Adic Complexity	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
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns	12
Synchronization Strings and Codes for Insertions and Deletions—A Survey	12
On L 2-Consistency of Nearest Neighbor Matching	12
Characterizing the Functional Density Power Divergence Class	12
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes	12
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels	12
Symplectic Self-Orthogonal Quasi-Cyclic Codes	12
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning	11
Exponential Savings in Agnostic Active Learning Through Abstention	11
Self-Orthogonal Codes From p-Divisible Codes	11
Decoding Reed–Solomon Skew-Differential Codes	11
Entanglement Cost of Discriminating Quantum States Under Locality Constraints	11
Privacy Amplification and Decoupling Without Smoothing	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
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods	11
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances	11
On the Best Lattice Quantizers	11
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission	11
Sketching Semidefinite Programs for Faster Clustering	11
A Construction of Minimal Linear Codes From Partial Difference Sets	11
Table of Contents	11
Some Punctured Codes of Several Families of Binary Linear Codes	11
From Letters to Words and Back: Invertible Coding of Stationary Measures	11
Generic Decoding in the Sum-Rank Metric	11
Provable Tradeoffs in Adversarially Robust Classification	11
Table of Contents	11
Optimal 1-bit Error Exponent for 2-Hop Relaying With Binary-Input Channels	11
Table of contents	11
Non-Reed-Solomon Type Cyclic MDS Codes	11
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model	11
Multi-Armed Bandits With Correlated Arms	11