IEEE Transactions on Information Theory

Article	Citations
Max-Linear Regression by Convex Programming	453
Dimension-Free Noninteractive Simulation From Gaussian Sources	350
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile	143
IEEE Transactions on Information Theory Publication Information	132
Table of Contents	131
Table of Contents	125
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm	99
A Locality-Based Lens for Coded Computation	79
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality	78
Fundamental Limits of Reference-Based Sequence Reordering	51
IEEE Transactions on Information Theory Information for Authors	51
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information	49
Breaking and Improving a Lattice-Code-Based Cryptosystem by Li, Ling, Xing, and Yeo	49
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation	44
Random Periodic Sampling Patterns for Shift-Invariant Spaces	42
Structural Complexity of One-Dimensional Random Geometric Graphs	42
IEEE Transactions on Information Theory Information for Authors	40
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help	39
Information Rates Over Multi-View Channels	39
Exact Recovery in the General Hypergraph Stochastic Block Model	38
Tsallis and Rényi Deformations Linked via a New λ-Duality	37
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography	37
Doeblin Curves	36
Communicating Over a Classical-Quantum MAC With State Information Distributed at the Senders	35
Communication Complexity of Exact Sampling Under Rényi Information	35

Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map	35
Capacities of Entanglement Distribution From a Central Source	35
Minimal Binary Linear Codes From Vectorial Boolean Functions	34
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes	33
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha	33
A Design of Five-Valued Spectra (Vectorial) Boolean Functions and Their Use in Constructing Bent Functions Outside $\mathcal{M}^{\#}$	33
Correcting One Deletion and One Substitution with a Constant Number of Reads	32
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints	32
On Information Theoretic Fairness: From Perfect to Bounded Demographic Parity	31
Federated Best Arm Identification With Heterogeneous Clients	31
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)	31
Pragmatic Lossless Compression: Fundamental Limits and Universality	31
Fast Correlation Attacks on K2 Stream Cipher	31
Improved Fast Correlation Attack Using Multiple Linear Approximations and Its Application on SOSEMANUK	30
IEEE Transactions on Information Theory Information for Authors	30
Table of Contents	30
Derandomizing Codes for the Adversarial Wiretap Channel of Type II	30
IEEE Transactions on Information Theory information for authors	30
IEEE Transactions on Information Theory Information for Authors	29
Private Inference in Quantized Models	28
A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction	28
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning	28
Improved Random-Binning Exponent for Distributed Hypothesis Testing	27
Computing Efficiently a Parity-Check Matrix for ℤ p s -Additive Codes	27
TechRxiv: Share Your Preprint Research with the World!	27
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints	26
Information-Theoretic Thresholds for Planted Dense Cycles	26
List-Decoding of AG Codes Without Genus Penalty	25
ARMA Processes With Discrete-Continuous Excitation: Compressibility Beyond Sparsity	25
The Generations of Classical Correlations via Quantum Schemes	25
Information Rates of Approximate Message Passing for Bandlimited Direct-Detection Channels	25
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k	25
Encoder Blind Combinatorial Compressed Sensing	25
The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes	25
The Number of Nonequivalent Monotone Boolean Functions of 8 Variables	25
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology	24
Uniquely-Decodable Coding for Zero-Error Network Function Computation	23
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm	23
Nearly Tight Bounds for Testing Tree Tensor Network States	23
Secure Codes With List Decoding	22
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp	22
Error-Correction for Sparse Support Recovery Algorithms	22
Rethinking Hard Thresholding Pursuit: Full Adaptation and Sharp Estimation	22
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature	22
Matroidal Entropy Functions: Constructions, Characterizations, and Representations	22
Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”	22
Log-Concave Sequences in Coding Theory	22
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target	22
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification	22
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel	22

Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming	22
Improving Wald’s (Approximate) Sequential Probability Ratio Test by Avoiding Overshoot	21
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes	21
New Theoretical Results for LAD-Based Sparse Recovery Using Expanders	21
Asymptotic Analysis of Nonlinear One-Bit Precoding in Massive MIMO Systems via Approximate Message Passing	21
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set	21
Unextendible Entanglement of Quantum Channels	21
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles	21
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement	21
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically	21
From List-Decodability to Proximity Gaps	21
The Capacity of the Weighted Read Channel	20
An Information-Theoretic Framework for Receiver Quantization in Communication	20
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements	20
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities	20
The Algebraic Characterization of ℳ-Subspaces of Bent Concatenations and Its Application	20
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables	20
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes	20
Revisiting Weighted Strategy for Non-Stationary Parametric Bandits and MDPs	20
Normalized Delivery Time of Wireless MapReduce	20
Multiset Combinatorial Gray Codes With Application to Proximity Sensor Networks	20
Bounds on Maximum Hermitian Hull Dimension of MDS Codes and MDS Codes With Explicit Hermitian Hulls	19
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions	19
The Dimension and Bose Distance of Some BCH Codes of Length $\frac{q^{m}-1}{\lambda}$	19
An Automated Theorem Proving Framework for Information-Theoretic Results	19
On the Gaussian-Quadratic Rate-Distortion Function for Vector Sources with Individual Distortion Constraints	19
The Platypus of the Quantum Channel Zoo	19
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction	19
On Enumerating Feasible Permutations for Rank Modulation Codes in DNA Storage via Hyperplane Arrangements	19
On the Cost of Consecutive Estimation Error: Significance-Aware Non-Linear Aging	19
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities	19
Linear Programming Bounds on k -Uniform States	19
Quantum Differentially Private Sparse Regression Learning	18
Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes	18
Towards an Asymptotic Efficiency Theory on Regular Parameter Manifolds	18
Simultaneous Estimation of Nonlinear Functionals of a Quantum State	18
Timely CPU Scheduling for Computation-Intensive Status Updates	18
Memory AMP	17
IEEE Transactions on Information Theory publication information	17
A Variational Principle for the Metric Mean Dimension of Level Sets	17
Pathwise Guessing in Categorical Time Series With Unbounded Alphabets	17
Zero-Error Capacity of the Chemical Residual Channel	17
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements	17
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization	17
Concatenated Codes for Multiple Reads of a DNA Sequence	17
Table of Contents	17
Bounds on MLDR Codes Over ???? pt	17
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach	17
The Nonlinear Filter Model of Stream Cipher Redivivus	16
A Refinement of Expurgation	16
Wei’s Duality for Generalized Poset Weight Over Galois Rings	16
Optimality of Meta-Converse for Channel Simulation	16
Analysis of Roth–Lempel Codes	16
Window-Limited CUSUM for Sequential Change Detection	16
Streaming Codes for Variable-Size Messages	16
Minimax Off-Policy Evaluation for Multi-Armed Bandits	16
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications	16
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes	16
Complex DNA Synthesis Sequences	16
Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes	16
The Asymptotic Capacity of Private Information Retrieval With Secure Storage Under Disjoint Colluding Sets	16
IEEE Transactions on Information Theory Publication Information	16
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment	16
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover	16
Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks	15
Reliability Function for Streaming Over a DMC With Feedback	15
Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions	15
Pearson Chi-Squared Conditional Randomization Test	15
Minimax Optimal Q Learning With Nearest Neighbors	15
Volume-Based Lower Bounds to the Capacity of the Gaussian Channel Under Pointwise Additive Input Constraints	15
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation	15
Virtual Quantum Markov Chains	15
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications	15
Quantum Coordination Rates in Multi-User Networks	15
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys	15
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy	15
Improved Decoding Algorithm of BD-LRPC Codes	15
An Information-Theoretic Framework for Out-of-Distribution Generalization With Applications to Stochastic Gradient Langevin Dynamics	15
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches	15
Tree Density Estimation	15

Information Limits of Joint Community Detection and Finite Group Synchronization	15
Improved Support Recovery in Universal 1-bit Compressed Sensing	15
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric	15
Private Noisy Side Information Helps to Increase the Capacity of SPIR	15
Generalized Singleton Type Upper Bounds	14
Neural Estimation and Optimization of Directed Information Over Continuous Spaces	14
Test-Measured Rényi Divergences	14
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise	14
Higher-Order Staircase Codes	14
Locally Repairable Convertible Codes: Improved Lower Bound and General Construction	14
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms	14
On Penalization in Stochastic Multi-Armed Bandits	14
Unsourced Multiple Access With Random User Activity	14
Bounds on Covert Capacity With Sub-Exponential Random Slot Selection	14
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes	14
The Hermitian Dual Codes of Several Classes of BCH Codes	14
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances	14
On Many-to-One Mappings Over Finite Fields	14
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data	14
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations	14
Optimal Best-Arm Identification Under Fixed Confidence With Multiple Optima	14
Learning From Heterogeneous Data Based on Social Interactions Over Graphs	14
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures	14
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements	14
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes	14
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning Using Passive Langevin Dynamics	14
On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model	14
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes	14
On the Fixed-Length-Burst Levenshtein Ball With Unit Radius	14
Gram–Schmidt Methods for Unsupervised Feature Extraction and Selection	14
How Many Simultaneous Beamformers are Needed for Integrated Sensing and Communications?	14
Gradient Descent Provably Solves Nonlinear Tomographic Reconstruction	14
Schrödinger-Föllmer Sampler	14
Universality Laws for High-Dimensional Learning With Random Features	14
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing	13
The First Achievement of a Given Level by a Random Process	13
Quantum Ruzsa Divergence to Quantify Magic	13
Quantum Multiple-Access One-Time Pad	13
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns	13
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models	13
Universal Graph Compression: Stochastic Block Models	13
IEEE Transactions on Information Theory Publication Information	13
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields	13
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	13
Sensitivity Analysis for Binary Sampling Systems via Quantitative Fisher Information Lower Bounds	13
From Letters to Words and Back: Invertible Coding of Stationary Measures	13
Symplectic Self-Orthogonal Quasi-Cyclic Codes	13
Self-Orthogonal Codes From p-Divisible Codes	13
Can Non-Signaling Assistance Increase the Degrees of Freedom of a Wireless Network?	13
Characterizing the Functional Density Power Divergence Class	13
Typicality for Stratified Measures	13
Griesmer Type Bounds for Nonlinear Codes and Their Applications	13
Table of Contents	13
Non-Reed-Solomon Type Cyclic MDS Codes	13
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around	13
On L 2-Consistency of Nearest Neighbor Matching	13
Information-Theoretic Analysis of Minimax Excess Risk	13
Entropic Compressibility of Lévy Processes	13
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model	13
Constant L₁-Weight Codes Under L∞-Metric	13
Flexible Distributed Matrix Multiplication	13
Estimating the Number of Rare Events with Applications to Large Alphabet Inference	13
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances	12
Divergence Estimation in Message Passing Algorithms	12
On the Shortest Codeword of the Optimal RVLC	12
Incremental Refinements and Multiple Descriptions With Feedback	12
Whispering Secrets in a Crowd: Leveraging Non-Covert Users for Covert Communications	12
Generic Decoding in the Sum-Rank Metric	12
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder	12
Error Exponents for Oblivious Relaying and Connections to Source Coding With a Helper	12
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity	12
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods	12
Generalized Orthogonal Approximate Message-Passing for Sublinear Sparsity	12
Table of Contents	12
Constacyclic Codes With Best-Known Parameters	12
Group Testing With Correlation Under Edge-Faulty Graphs	12
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design	12
Provable Tradeoffs in Adversarially Robust Classification	12
Maximum-Order Complexity and 2-Adic Complexity	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
Rotation-Symmetric Bent Functions Outside the Completed Maiorana-McFarland Class	12
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes	12
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel	12
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing	12
Radon-Hurwitz Grassmannian Codes	12
Optimal 1-bit Error Exponent for 2-Hop Relaying With Binary-Input Channels	12
List Decoding Random Euclidean Codes and Infinite Constellations	12
Combinatorial-Probabilistic Trade-Off: P-Values of Community Property Test in the Stochastic Block Models	12
On de Bruijn Array Codes—Part I: Nonlinear Codes	12
Privacy Amplification and Decoupling Without Smoothing	12
Abelian Group Codes for Classical-Quantum Channels: One-Shot and Asymptotic Rate Bounds	12
Characterizations of Primitive and Projective Self-Orthogonal BCH Codes and Their Parameters	12
Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-Based Approach	12
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel	12