IEEE Transactions on Information Theory

Article	Citations
Template Matching and Change Point Detection by M-Estimation	314
The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields	206
Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors	108
Random Periodic Sampling Patterns for Shift-Invariant Spaces	104
Federated Best Arm Identification With Heterogeneous Clients	95
Max-Linear Regression by Convex Programming	94
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help	75
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets	65
Dimension-Free Noninteractive Simulation From Gaussian Sources	60
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile	58
Information Rates Over Multi-View Channels	55
IEEE Transactions on Information Theory Publication Information	53
Table of Contents	52
Table of Contents	48
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm	48
Proceedings of the IEEE	41
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints	41
Communicating Over a Classical-Quantum MAC With State Information Distributed at the Senders	41
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation	40
IEEE Transactions on Information Theory Information for Authors	39
Breaking and Improving a Lattice-Code-Based Cryptosystem by Li, Ling, Xing, and Yeo	36
Minimal Binary Linear Codes From Vectorial Boolean Functions	35
Tsallis and Rényi Deformations Linked via a New λ-Duality	33
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes	33
Sharp Variance-Entropy Comparison for Nonnegative Gaussian Quadratic Forms	33

Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha	33
A Locality-Based Lens for Coded Computation	32
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography	31
Fast Correlation Attacks on K2 Stream Cipher	31
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information	31
Discrete Signaling and Treating Interference as Noise for the Gaussian Interference Channel	31
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality	31
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map	31
Exact Recovery in the General Hypergraph Stochastic Block Model	30
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)	30
Structural Complexity of One-Dimensional Random Geometric Graphs	30
Fundamental Limits of Reference-Based Sequence Reordering	29
IEEE Transactions on Information Theory Information for Authors	29
Recoverable Systems	29
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k	28
IEEE Transactions on Information Theory information for authors	28
Table of Contents	28
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements	28
Matroidal Entropy Functions: Constructions, Characterizations, and Representations	27
Improved Fast Correlation Attack Using Multiple Linear Approximations and Its Application on SOSEMANUK	27
Normalized Delivery Time of Wireless MapReduce	27
Information-Theoretic Thresholds for Planted Dense Cycles	27
A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction	27
An Algorithmic Reduction Theory for Binary Codes: LLL and More	26
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities	26
IEEE Transactions on Information Theory Information for Authors	26
Private Inference in Quantized Models	26
Derandomizing Codes for the Adversarial Wiretap Channel of Type II	26
Computing Efficiently a Parity-Check Matrix for ℤ p s -Additive Codes	25
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target	25
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set	25
Encoding Classical Information Into Quantum Resources	25
A Variational Principle for the Metric Mean Dimension of Level Sets	25
The Algebraic Characterization of ℳ-Subspaces of Bent Concatenations and Its Application	25
Secure Codes With List Decoding	24
Guesswork With Quantum Side Information	24
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning	24
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm	23
Encoder Blind Combinatorial Compressed Sensing	23
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities	23
Log-Concave Sequences in Coding Theory	23
ARMA Processes With Discrete-Continuous Excitation: Compressibility Beyond Sparsity	23
On the Cost of Consecutive Estimation Error: Significance-Aware Non-Linear Aging	23
The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes	23
Unextendible Entanglement of Quantum Channels	23
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology	22
The Number of Nonequivalent Monotone Boolean Functions of 8 Variables	22
The Generations of Classical Correlations via Quantum Schemes	22
List-Decoding of AG Codes Without Genus Penalty	22
Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties	22

Distributed Compression of Graphical Data	21
An Automated Theorem Proving Framework for Information-Theoretic Results	21
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically	21
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables	21
Error-Correction for Sparse Support Recovery Algorithms	21
Limitations on Transversal Gates for Hypergraph Product Codes	21
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes	21
Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited	21
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints	21
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks	21
Rethinking Hard Thresholding Pursuit: Full Adaptation and Sharp Estimation	20
The Platypus of the Quantum Channel Zoo	20
Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”	20
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions	20
Improved Random-Binning Exponent for Distributed Hypothesis Testing	20
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification	20
On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions	20
Quantum Differentially Private Sparse Regression Learning	20
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp	20
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel	20
Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes	20
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement	20
Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming	19
Zero-Error Capacity of the Chemical Residual Channel	19
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach	19
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature	19
Covering Radius of Melas Codes	19
Table of Contents	19
Bounds on MLDR Codes Over ???? pt	19
Memory AMP	19
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction	19
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes	19
IEEE Transactions on Information Theory publication information	19
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles	19
Minimax Optimal Q Learning With Nearest Neighbors	18
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise	18
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations	18
IEEE Transactions on Information Theory Publication Information	18
Generalized Singleton Type Upper Bounds	18
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment	18
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures	18
Asymptotic Bounds on the Rate of Locally Repairable Codes	18
A Refinement of Expurgation	18
Pearson Chi-squared Conditional Randomization Test	18
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances	18
Flexible Distributed Matrix Multiplication	18
A Deterministic Algorithm for the Capacity of Finite-State Channels	18
Minimax Off-Policy Evaluation for Multi-Armed Bandits	18
Neural Estimation and Optimization of Directed Information Over Continuous Spaces	18
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes	17
Window-Limited CUSUM for Sequential Change Detection	17
Wei’s Duality for Generalized Poset Weight Over Galois Rings	17
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover	17
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements	17
Universality Laws for High-Dimensional Learning With Random Features	17
Improved Support Recovery in Universal 1-bit Compressed Sensing	17
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys	17
Gram–Schmidt Methods for Unsupervised Feature Extraction and Selection	16
On Penalization in Stochastic Multi-Armed Bandits	16
An Information-Theoretic Framework for Out-of-Distribution Generalization With Applications to Stochastic Gradient Langevin Dynamics	16
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization	16
Schrödinger-Föllmer Sampler	16
The Hermitian Dual Codes of Several Classes of BCH Codes	16
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data	16
Higher-Order Staircase Codes	16
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches	16
On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model	16
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers	16
Virtual Quantum Markov Chains	16
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	16
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements	16
Reliability Function for Streaming Over a DMC With Feedback	15
Private Noisy Side Information Helps to Increase the Capacity of SPIR	15
Quantum Coordination Rates in Multi-User Networks	15
Information Limits of Joint Community Detection and Finite Group Synchronization	15
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes	15
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications	15
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications	15
Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks	15
Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes	15

Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions	15
Streaming Codes for Variable-Size Messages	15
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric	15
Tree Density Estimation	15
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning Using Passive Langevin Dynamics	15
Bounds on Covert Capacity With Sub-Exponential Random Slot Selection	15
On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of Information	15
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms	15
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields	14
Conditional Independence Structures Over Four Discrete Random Variables Revisited: Conditional Ingleton Inequalities	14
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation	14
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes	14
Unsourced Multiple Access With Random User Activity	14
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel	14
Typicality for Stratified Measures	14
Learning From Heterogeneous Data Based on Social Interactions Over Graphs	14
Concatenated Codes for Multiple Reads of a DNA Sequence	14
Analysis of Roth-Lempel codes	14
Griesmer Type Bounds for Nonlinear Codes and Their Applications	14
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing	14
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy	14
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy	14
Test-Measured Rényi Divergences	14
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes	14
The First Achievement of a Given Level by a Random Process	13
Sensitivity Analysis for Binary Sampling Systems via Quantitative Fisher Information Lower Bounds	13
Exponential Savings in Agnostic Active Learning Through Abstention	13
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames	13
The Isometry-Dual Property in Flags of Two-Point Algebraic Geometry Codes	13
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns	13
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel	13
On Recovery of Sparse Signals With Prior Support Information via Weighted ℓₚ-Minimization	13
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing	13
From Letters to Words and Back: Invertible Coding of Stationary Measures	13
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model	13
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access	13
Constant L₁-Weight Codes Under L∞-Metric	13
On L 2-Consistency of Nearest Neighbor Matching	13
Limit Distribution Theory for f-Divergences	13
Characterizing the Functional Density Power Divergence Class	13
Table of Contents	13
Node Repair on Connected Graphs	13
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances	13
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes	13
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design	13
IEEE Transactions on Information Theory Publication Information	13
Symplectic Self-Orthogonal Quasi-Cyclic Codes	13
On Sampling Continuous-Time AWGN Channels	13
Codes Correcting Two Bursts of Exactly b Deletions	13
Non-Reed-Solomon Type Cyclic MDS Codes	13
Mitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers	12
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models	12
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around	12
Self-Orthogonal Codes From p-Divisible Codes	12
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes	12
Quantum Multiple-Access One-Time Pad	12
Quantum Ruzsa Divergence to Quantify Magic	12
Entropic Compressibility of Lévy Processes	12
Maximum-Order Complexity and 2-Adic Complexity	12
Generic Decoding in the Sum-Rank Metric	12
Clustering-Correcting Codes	12
On de Bruijn Array Codes—Part I: Nonlinear Codes	12
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels	12
On the Best Lattice Quantizers	12
Invertible Low-Divergence Coding	12
Privacy Amplification and Decoupling Without Smoothing	12
Provable Tradeoffs in Adversarially Robust Classification	12
Two-Insertion/Deletion/Substitution Correcting Codes	12
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning	12
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods	12
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity	12
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder	12
Minimax Converse for Identification via Channels	12
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity	12
MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction	12
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission	12
Decoding Reed–Solomon Skew-Differential Codes	12
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays	12
Information-Theoretic Analysis of Minimax Excess Risk	12
Proof of a Conjectured 0-Rényi Entropy Inequality With Applications to Multipartite Entanglement	11
Space Complexity of Euclidean Clustering	11
Reduced Complexity Interval Passing for Sparse Signal Recovery	11
Succinct Quantum Testers for Closeness and k-Wise Uniformity of Probability Distributions	11
Secure List Decoding and its Application to Bit-String Commitment	11
Group Testing With Correlation Under Edge-Faulty Graphs	11
Fractal Gaussian Networks: A Sparse Random Graph Model Based on Gaussian Multiplicative Chaos	11
DNA-Correcting Codes: End-to-End Correction in DNA Storage Systems	11
On Estimating Rank-One Spiked Tensors in the Presence of Heavy Tailed Errors	11
Table of Contents	11
Entanglement Cost of Discriminating Quantum States Under Locality Constraints	11
Retrieving Data Permutations From Noisy Observations: Asymptotics	11
Codes Over Absorption Channels	11
Quadratic Privacy-Signaling Games and the MMSE Information Bottleneck Problem for Gaussian Sources	11
Deep Dimension Reduction for Supervised Representation Learning	11
Radon-Hurwitz Grassmannian Codes	11