IEEE Transactions on Information Theory

Article	Citations
Federated Best Arm Identification With Heterogeneous Clients	411
Max-Linear Regression by Convex Programming	308
Dimension-Free Noninteractive Simulation From Gaussian Sources	137
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile	124
IEEE Transactions on Information Theory Publication Information	122
Table of Contents	116
Table of Contents	89
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm	73
Communicating Over a Classical-Quantum MAC With State Information Distributed at the Senders	70
A Locality-Based Lens for Coded Computation	53
Fundamental Limits of Reference-Based Sequence Reordering	47
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality	47
Recoverable Systems	46
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map	44
IEEE Transactions on Information Theory Information for Authors	43
Breaking and Improving a Lattice-Code-Based Cryptosystem by Li, Ling, Xing, and Yeo	42
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information	41
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)	40
Fast Correlation Attacks on K2 Stream Cipher	40
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation	39
Doeblin Curves	37
Communication Complexity of Exact Sampling under Rényi Information	37
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints	36
Random Periodic Sampling Patterns for Shift-Invariant Spaces	36
Structural Complexity of One-Dimensional Random Geometric Graphs	36

Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha	35
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography	34
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes	34
Minimal Binary Linear Codes From Vectorial Boolean Functions	34
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help	34
IEEE Transactions on Information Theory Information for Authors	34
Tsallis and Rényi Deformations Linked via a New λ-Duality	33
Exact Recovery in the General Hypergraph Stochastic Block Model	33
Information Rates Over Multi-View Channels	32
Capacities of Entanglement Distribution From a Central Source	32
IEEE Transactions on Information Theory Information for Authors	31
IEEE Transactions on Information Theory information for authors	31
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements	30
Derandomizing Codes for the Adversarial Wiretap Channel of Type II	29
A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction	29
Improved Fast Correlation Attack Using Multiple Linear Approximations and Its Application on SOSEMANUK	29
IEEE Transactions on Information Theory Information for Authors	29
Table of Contents	29
Improved Random-Binning Exponent for Distributed Hypothesis Testing	28
TechRxiv: Share Your Preprint Research with the World!	28
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning	28
Private Inference in Quantized Models	28
Encoding Classical Information Into Quantum Resources	28
Normalized Delivery Time of Wireless MapReduce	27
Computing Efficiently a Parity-Check Matrix for ℤ p s -Additive Codes	27
The dimension and Bose distance of some BCH codes of length q m −1/λ	26
Quantum Differentially Private Sparse Regression Learning	26
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction	26
Information-Theoretic Thresholds for Planted Dense Cycles	26
Asymptotic Analysis of Nonlinear One-Bit Precoding in Massive MIMO Systems via Approximate Message Passing	26
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints	26
A Variational Principle for the Metric Mean Dimension of Level Sets	25
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities	24
Memory AMP	24
From List-Decodability to Proximity Gaps	24
The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes	24
List-Decoding of AG Codes Without Genus Penalty	24
Information Rates of Approximate Message Passing for Bandlimited Direct-Detection Channels	24
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k	24
The Number of Nonequivalent Monotone Boolean Functions of 8 Variables	23
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp	23
Encoder Blind Combinatorial Compressed Sensing	23
Rethinking Hard Thresholding Pursuit: Full Adaptation and Sharp Estimation	23
ARMA Processes With Discrete-Continuous Excitation: Compressibility Beyond Sparsity	23
The Generations of Classical Correlations via Quantum Schemes	23
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology	23
Revisiting Weighted Strategy for Non-Stationary Parametric Bandits and MDPs	22
Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming	22
Error-Correction for Sparse Support Recovery Algorithms	22
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities	22

Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes	22
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel	22
Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”	22
An Algorithmic Reduction Theory for Binary Codes: LLL and More	22
Log-Concave Sequences in Coding Theory	22
New Theoretical Results for LAD-Based Sparse Recovery Using Expanders	21
The Platypus of the Quantum Channel Zoo	21
Covering Radius of Melas Codes	21
An Information-Theoretic Framework for Receiver Quantization in Communication	21
Improving Wald’s (Approximate) Sequential Probability Ratio Test by Avoiding Overshoot	21
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions	21
An Automated Theorem Proving Framework for Information-Theoretic Results	21
Multiset Combinatorial Gray Codes With Application to Proximity Sensor Networks	21
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles	21
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically	21
Unextendible Entanglement of Quantum Channels	20
Nearly Tight Bounds for Testing Tree Tensor Network States	20
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set	20
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes	20
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes	20
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement	20
The Algebraic Characterization of ℳ-Subspaces of Bent Concatenations and Its Application	20
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification	20
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm	20
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables	20
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target	19
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature	19
Matroidal Entropy Functions: Constructions, Characterizations, and Representations	19
Secure Codes With List Decoding	18
IEEE Transactions on Information Theory publication information	18
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise	18
IEEE Transactions on Information Theory Publication Information	18
Information Limits of Joint Community Detection and Finite Group Synchronization	18
Zero-Error Capacity of the Chemical Residual Channel	18
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach	18
A Refinement of Expurgation	18
Wei’s Duality for Generalized Poset Weight Over Galois Rings	18
Generalized Singleton Type Upper Bounds	18
On the Cost of Consecutive Estimation Error: Significance-Aware Non-Linear Aging	18
Table of Contents	18
Bounds on MLDR Codes Over ???? pt	18
Minimax Off-Policy Evaluation for Multi-Armed Bandits	18
An Information-Theoretic Framework for Out-of-Distribution Generalization With Applications to Stochastic Gradient Langevin Dynamics	18
Test-Measured Rényi Divergences	17
On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model	17
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches	17
Reliability Function for Streaming Over a DMC With Feedback	17
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data	17
Flexible Distributed Matrix Multiplication	17
Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions	17
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers	17
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications	17
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation	17
Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes	17
Schrödinger-Föllmer Sampler	17
Tree Density Estimation	17
Pearson Chi-Squared Conditional Randomization Test	16
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning Using Passive Langevin Dynamics	16
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms	16
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes	16
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations	16
Streaming Codes for Variable-Size Messages	16
Bounds on Covert Capacity With Sub-Exponential Random Slot Selection	16
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric	16
Improved Support Recovery in Universal 1-bit Compressed Sensing	16
On the Fixed-Length-Burst Levenshtein Ball With Unit Radius	16
Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks	16
Quantum Coordination Rates in Multi-User Networks	16
Improved Decoding Algorithm of BD-LRPC Codes	16
Analysis of Roth–Lempel Codes	16
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements	16
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys	15
Gram–Schmidt Methods for Unsupervised Feature Extraction and Selection	15
Unsourced Multiple Access With Random User Activity	15
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications	15
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy	15
Minimax Optimal Q Learning With Nearest Neighbors	15
Concatenated Codes for Multiple Reads of a DNA Sequence	15
The Hermitian Dual Codes of Several Classes of BCH Codes	15
Neural Estimation and Optimization of Directed Information Over Continuous Spaces	15

On Penalization in Stochastic Multi-Armed Bandits	15
Private Noisy Side Information Helps to Increase the Capacity of SPIR	15
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment	15
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances	15
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures	15
Window-Limited CUSUM for Sequential Change Detection	15
Learning From Heterogeneous Data Based on Social Interactions Over Graphs	15
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization	15
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes	15
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements	15
Volume-Based Lower Bounds to the Capacity of the Gaussian Channel Under Pointwise Additive Input Constraints	15
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover	14
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes	14
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing	14
Typicality for Stratified Measures	14
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing	14
Characterizing the Functional Density Power Divergence Class	14
Table of Contents	14
Griesmer Type Bounds for Nonlinear Codes and Their Applications	14
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	14
Gradient Descent Provably Solves Nonlinear Tomographic Reconstruction	14
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields	14
On Many-to-One Mappings Over Finite Fields	14
Maximum-Order Complexity and 2-Adic Complexity	14
The First Achievement of a Given Level by a Random Process	14
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access	14
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel	14
Universality Laws for High-Dimensional Learning With Random Features	14
Locally Repairable Convertible Codes: Improved Lower Bound and General Construction	14
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes	14
Optimal Best-Arm Identification Under Fixed Confidence With Multiple Optima	14
IEEE Transactions on Information Theory Publication Information	14
Quantum Multiple-Access One-Time Pad	14
From Letters to Words and Back: Invertible Coding of Stationary Measures	14
Sensitivity Analysis for Binary Sampling Systems via Quantitative Fisher Information Lower Bounds	14
Constant L₁-Weight Codes Under L∞-Metric	14
Higher-Order Staircase Codes	14
Virtual Quantum Markov Chains	14
Non-Reed-Solomon Type Cyclic MDS Codes	13
Universal Graph Compression: Stochastic Block Models	13
Codes Correcting Two Bursts of Exactly b Deletions	13
Entropic Compressibility of Lévy Processes	13
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity	13
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels	13
Quantum Ruzsa Divergence to Quantify Magic	13
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around	13
Node Repair on Connected Graphs	13
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model	13
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity	13
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes	13
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns	13
Can Non-Signaling Assistance Increase the Degrees of Freedom of a Wireless Network?	13
Two-Insertion/Deletion/Substitution Correcting Codes	13
Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-Based Approach	13
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods	13
Error Exponents for Oblivious Relaying and Connections to Source Coding With a Helper	13
On de Bruijn Array Codes—Part I: Nonlinear Codes	13
On L 2-Consistency of Nearest Neighbor Matching	13
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission	13
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames	13
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder	13
Self-Orthogonal Codes From p-Divisible Codes	13
Generic Decoding in the Sum-Rank Metric	13
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design	13
On the Best Lattice Quantizers	12
Rotation-symmetric bent functions outside the completed Maiorana-McFarland class	12
Information-Theoretic Analysis of Minimax Excess Risk	12
Symplectic Self-Orthogonal Quasi-Cyclic Codes	12
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models	12
Incremental Refinements and Multiple Descriptions With Feedback	12
Reduced Complexity Interval Passing for Sparse Signal Recovery	12
Radon-Hurwitz Grassmannian Codes	12
Combinatorial-Probabilistic Trade-Off: P-Values of Community Property Test in the Stochastic Block Models	12
List Decoding Random Euclidean Codes and Infinite Constellations	12
Rate-Distortion-Perception Theory for the Quadratic Wasserstein Space	12
Limit Distribution Theory for f-Divergences	12
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances	12
Characterizations of Primitive and Projective Self-Orthogonal BCH Codes and Their Parameters	12
Privacy Amplification and Decoupling Without Smoothing	12
Exponential Savings in Agnostic Active Learning Through Abstention	12
Abelian Group Codes for Classical-Quantum Channels: One-shot and Asymptotic Rate Bounds	12
Succinct Quantum Testers for Closeness and k-Wise Uniformity of Probability Distributions	12
Fractal Gaussian Networks: A Sparse Random Graph Model Based on Gaussian Multiplicative Chaos	12
Optimal 1-bit Error Exponent for 2-Hop Relaying With Binary-Input Channels	12
Divergence Estimation in Message Passing Algorithms	12
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel	12
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes	12
Provable Tradeoffs in Adversarially Robust Classification	12
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning	12
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays	12
On the Shortest Codeword of the Optimal RVLC	12
A New Sieving-Style Information-Set Decoding Algorithm	12
Table of Contents	12
Localization From Structured Distance Matrices via Low-Rank Matrix Recovery	12
Group Testing With Correlation Under Edge-Faulty Graphs	12