IEEE Transactions on Information Theory

Article	Citations
Federated Best Arm Identification With Heterogeneous Clients	422
Max-Linear Regression by Convex Programming	312
Dimension-Free Noninteractive Simulation From Gaussian Sources	141
IEEE Transactions on Information Theory Publication Information	125
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile	125
Table of Contents	118
Table of Contents	91
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm	75
A Locality-Based Lens for Coded Computation	70
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality	53
Fundamental Limits of Reference-Based Sequence Reordering	48
IEEE Transactions on Information Theory Information for Authors	47
Recoverable Systems	47
Breaking and Improving a Lattice-Code-Based Cryptosystem by Li, Ling, Xing, and Yeo	45
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)	42
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information	42
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation	40
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints	39
Structural Complexity of One-Dimensional Random Geometric Graphs	38
Random Periodic Sampling Patterns for Shift-Invariant Spaces	38
IEEE Transactions on Information Theory Information for Authors	37
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help	36
Fast Correlation Attacks on K2 Stream Cipher	35
Exact Recovery in the General Hypergraph Stochastic Block Model	35
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha	34

Pragmatic Lossless Compression: Fundamental Limits and Universality	34
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography	34
Tsallis and Rényi Deformations Linked via a New λ-Duality	34
Communication Complexity of Exact Sampling Under Rényi Information	33
Doeblin Curves	33
Information Rates Over Multi-View Channels	33
Capacities of Entanglement Distribution From a Central Source	32
On Information Theoretic Fairness: From Perfect To Bounded Demographic Parity	32
A design of five-valued spectra (vectorial) Boolean functions and their use in constructing bent functions outside M #	32
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map	31
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes	31
Communicating Over a Classical-Quantum MAC With State Information Distributed at the Senders	30
Minimal Binary Linear Codes From Vectorial Boolean Functions	30
Derandomizing Codes for the Adversarial Wiretap Channel of Type II	29
IEEE Transactions on Information Theory information for authors	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
IEEE Transactions on Information Theory Information for Authors	29
Table of Contents	29
Improved Random-Binning Exponent for Distributed Hypothesis Testing	28
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning	28
TechRxiv: Share Your Preprint Research with the World!	28
Private Inference in Quantized Models	28
Encoding Classical Information Into Quantum Resources	28
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction	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/λ	27
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints	27
Information-Theoretic Thresholds for Planted Dense Cycles	26
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k	25
Memory AMP	25
A Variational Principle for the Metric Mean Dimension of Level Sets	25
List-Decoding of AG Codes Without Genus Penalty	25
Information Rates of Approximate Message Passing for Bandlimited Direct-Detection Channels	24
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities	24
The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes	24
The Number of Nonequivalent Monotone Boolean Functions of 8 Variables	23
An Automated Theorem Proving Framework for Information-Theoretic Results	23
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology	23
Encoder Blind Combinatorial Compressed Sensing	23
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm	23
ARMA Processes With Discrete-Continuous Excitation: Compressibility Beyond Sparsity	23
The Generations of Classical Correlations via Quantum Schemes	23
Uniquely-Decodable Coding for Zero-Error Network Function Computation	23
Matroidal Entropy Functions: Constructions, Characterizations, and Representations	22
On the Cost of Consecutive Estimation Error: Significance-Aware Non-Linear Aging	22
Secure Codes With List Decoding	22
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification	22
Timely CPU Scheduling for Computation-intensive Status Updates	22

Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target	22
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature	22
Nearly Tight Bounds for Testing Tree Tensor Network States	22
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp	22
Rethinking Hard Thresholding Pursuit: Full Adaptation and Sharp Estimation	21
Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”	21
New Theoretical Results for LAD-Based Sparse Recovery Using Expanders	21
Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming	21
Error-Correction for Sparse Support Recovery Algorithms	21
Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes	21
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel	21
Improving Wald’s (Approximate) Sequential Probability Ratio Test by Avoiding Overshoot	21
Log-Concave Sequences in Coding Theory	21
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles	21
Covering Radius of Melas Codes	21
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set	20
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes	20
Revisiting Weighted Strategy for Non-Stationary Parametric Bandits and MDPs	20
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement	20
Unextendible Entanglement of Quantum Channels	20
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities	20
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables	20
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically	20
An Information-Theoretic Framework for Receiver Quantization in Communication	19
From List-Decodability to Proximity Gaps	19
The Algebraic Characterization of ℳ-Subspaces of Bent Concatenations and Its Application	19
Multiset Combinatorial Gray Codes With Application to Proximity Sensor Networks	19
On Enumerating Feasible Permutations for Rank Modulation Codes in DNA storage via Hyperplane Arrangements	19
Pathwise guessing in categorical time series with unbounded alphabets	19
Asymptotic Analysis of Nonlinear One-Bit Precoding in Massive MIMO Systems via Approximate Message Passing	19
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes	19
A Refinement of Expurgation	18
An Information-Theoretic Framework for Out-of-Distribution Generalization With Applications to Stochastic Gradient Langevin Dynamics	18
Quantum Differentially Private Sparse Regression Learning	18
Normalized Delivery Time of Wireless MapReduce	18
Table of Contents	18
Bounds on MLDR Codes Over ???? pt	18
Minimax Off-Policy Evaluation for Multi-Armed Bandits	18
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach	18
The Platypus of the Quantum Channel Zoo	18
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions	18
IEEE Transactions on Information Theory publication information	18
Generalized Singleton Type Upper Bounds	18
Wei’s Duality for Generalized Poset Weight Over Galois Rings	18
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements	18
Zero-Error Capacity of the Chemical Residual Channel	18
IEEE Transactions on Information Theory Publication Information	18
Optimality of meta-converse for channel simulation	17
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes	17
Information Limits of Joint Community Detection and Finite Group Synchronization	17
Virtual Quantum Markov Chains	17
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches	17
Schrödinger-Föllmer Sampler	17
Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks	17
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers	17
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation	16
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications	16
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning Using Passive Langevin Dynamics	16
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements	16
Bounds on Covert Capacity With Sub-Exponential Random Slot Selection	16
Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes	16
Reliability Function for Streaming Over a DMC With Feedback	16
Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions	16
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric	16
Improved Decoding Algorithm of BD-LRPC Codes	16
Flexible Distributed Matrix Multiplication	16
Tree Density Estimation	16
Quantum Coordination Rates in Multi-User Networks	16
Pearson Chi-Squared Conditional Randomization Test	16
Volume-Based Lower Bounds to the Capacity of the Gaussian Channel Under Pointwise Additive Input Constraints	16
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy	15
Improved Support Recovery in Universal 1-bit Compressed Sensing	15
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization	15
Gram–Schmidt Methods for Unsupervised Feature Extraction and Selection	15
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover	15
Optimal Best-Arm Identification Under Fixed Confidence With Multiple Optima	15
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys	15
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment	15
Analysis of Roth–Lempel Codes	15
The Hermitian Dual Codes of Several Classes of BCH Codes	15

Learning From Heterogeneous Data Based on Social Interactions Over Graphs	15
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes	15
Locally Repairable Convertible Codes: Improved Lower Bound and General Construction	15
Private Noisy Side Information Helps to Increase the Capacity of SPIR	15
Minimax Optimal Q Learning With Nearest Neighbors	15
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations	15
Neural Estimation and Optimization of Directed Information Over Continuous Spaces	15
On Penalization in Stochastic Multi-Armed Bandits	15
Gradient Descent Provably Solves Nonlinear Tomographic Reconstruction	15
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures	15
On Many-to-One Mappings Over Finite Fields	14
Constant L₁-Weight Codes Under L∞-Metric	14
Concatenated Codes for Multiple Reads of a DNA Sequence	14
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing	14
Higher-Order Staircase Codes	14
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels	14
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements	14
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields	14
On the Fixed-Length-Burst Levenshtein Ball With Unit Radius	14
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise	14
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms	14
IEEE Transactions on Information Theory Publication Information	14
Unsourced Multiple Access With Random User Activity	14
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission	14
Window-Limited CUSUM for Sequential Change Detection	14
Universality Laws for High-Dimensional Learning With Random Features	14
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data	14
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances	14
Streaming Codes for Variable-Size Messages	14
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel	14
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications	14
Typicality for Stratified Measures	14
Test-Measured Rényi Divergences	14
Griesmer Type Bounds for Nonlinear Codes and Their Applications	14
On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model	14
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes	14
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes	14
Maximum-Order Complexity and 2-Adic Complexity	13
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
Characterizing the Functional Density Power Divergence Class	13
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns	13
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels	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
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames	13
Can Non-Signaling Assistance Increase the Degrees of Freedom of a Wireless Network?	13
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity	13
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model	13
Table of Contents	13
From Letters to Words and Back: Invertible Coding of Stationary Measures	13
Quantum Multiple-Access One-Time Pad	13
Privacy Amplification and Decoupling Without Smoothing	13
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder	13
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around	13
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design	13
Entropic Compressibility of Lévy Processes	13
On de Bruijn Array Codes—Part I: Nonlinear Codes	13
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access	13
Universal Graph Compression: Stochastic Block Models	13
Information-Theoretic Analysis of Minimax Excess Risk	13
On the Best Lattice Quantizers	13
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning	13
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel	13
On L 2-Consistency of Nearest Neighbor Matching	13
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models	13
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing	13
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity	12
Two-Insertion/Deletion/Substitution Correcting Codes	12
Generic Decoding in the Sum-Rank Metric	12
Rate-Distortion-Perception Theory for the Quadratic Wasserstein Space	12
Self-Orthogonal Codes From p-Divisible Codes	12
Characterizations of Primitive and Projective Self-Orthogonal BCH Codes and Their Parameters	12
Group Testing With Correlation Under Edge-Faulty Graphs	12
Constacyclic codes with best-known parameters	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
Symplectic Self-Orthogonal Quasi-Cyclic Codes	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
Codes Correcting Two Bursts of Exactly b Deletions	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
Non-Reed-Solomon Type Cyclic MDS Codes	12
Incremental Refinements and Multiple Descriptions With Feedback	12
Quantum Ruzsa Divergence to Quantify Magic	12
Provable Tradeoffs in Adversarially Robust Classification	12
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays	12
Exponential Savings in Agnostic Active Learning Through Abstention	12
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes	12
Abelian Group Codes for Classical-Quantum Channels: One-Shot and Asymptotic Rate Bounds	12
On the Shortest Codeword of the Optimal RVLC	12
Optimal 1-bit Error Exponent for 2-Hop Relaying With Binary-Input Channels	12
Error Exponents for Oblivious Relaying and Connections to Source Coding With a Helper	12
Deep Dimension Reduction for Supervised Representation Learning	11