IEEE Transactions on Information Theory

Papers
(The median citation count of IEEE Transactions on Information Theory is 2. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-01-01 to 2026-01-01.)
ArticleCitations
Template Matching and Change Point Detection by M-Estimation349
Federated Best Arm Identification With Heterogeneous Clients227
Max-Linear Regression by Convex Programming118
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help117
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets105
Dimension-Free Noninteractive Simulation From Gaussian Sources103
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile102
IEEE Transactions on Information Theory Publication Information72
Table of Contents67
Table of Contents58
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm57
Communicating Over a Classical-Quantum MAC With State Information Distributed at the Senders57
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints52
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation48
Exact Recovery in the General Hypergraph Stochastic Block Model44
Recoverable Systems41
Fundamental Limits of Reference-Based Sequence Reordering40
IEEE Transactions on Information Theory Information for Authors38
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map38
Breaking and Improving a Lattice-Code-Based Cryptosystem by Li, Ling, Xing, and Yeo37
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes36
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality34
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography34
A Locality-Based Lens for Coded Computation34
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information34
Structural Complexity of One-Dimensional Random Geometric Graphs33
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)33
Fast Correlation Attacks on K2 Stream Cipher33
Information Rates Over Multi-View Channels33
Tsallis and Rényi Deformations Linked via a New λ-Duality31
Minimal Binary Linear Codes From Vectorial Boolean Functions31
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha31
Random Periodic Sampling Patterns for Shift-Invariant Spaces31
Table of Contents30
Improved Fast Correlation Attack Using Multiple Linear Approximations and Its Application on SOSEMANUK30
IEEE Transactions on Information Theory Information for Authors30
IEEE Transactions on Information Theory information for authors30
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements30
Derandomizing Codes for the Adversarial Wiretap Channel of Type II30
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities29
IEEE Transactions on Information Theory Information for Authors29
Private Inference in Quantized Models29
An Algorithmic Reduction Theory for Binary Codes: LLL and More29
Covering Radius of Melas Codes28
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles28
Quantum Differentially Private Sparse Regression Learning28
Encoding Classical Information Into Quantum Resources27
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables27
Multiset Combinatorial Gray Codes with Application to Proximity Sensor Networks27
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement27
TechRxiv: Share Your Preprint Research with the World!27
Computing Efficiently a Parity-Check Matrix for ℤ p s -Additive Codes26
Several Families of Self-Orthogonal Codes and Their Applications in Optimal Quantum Codes and LCD Codes26
Normalized Delivery Time of Wireless MapReduce26
Secure Codes With List Decoding25
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm25
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities25
Guesswork With Quantum Side Information25
The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes25
List-Decoding of AG Codes Without Genus Penalty24
ARMA Processes With Discrete-Continuous Excitation: Compressibility Beyond Sparsity24
Encoder Blind Combinatorial Compressed Sensing24
The Number of Nonequivalent Monotone Boolean Functions of 8 Variables24
Unextendible Entanglement of Quantum Channels24
Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties23
The Generations of Classical Correlations via Quantum Schemes23
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp23
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology23
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks23
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints23
Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited23
Distributed Compression of Graphical Data23
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically23
Error-Correction for Sparse Support Recovery Algorithms22
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel22
Improved Random-Binning Exponent for Distributed Hypothesis Testing22
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification22
Rethinking Hard Thresholding Pursuit: Full Adaptation and Sharp Estimation22
A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction22
The Platypus of the Quantum Channel Zoo22
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions21
Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming21
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature21
Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes21
Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”21
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes21
The Algebraic Characterization of ℳ-Subspaces of Bent Concatenations and Its Application21
Log-Concave Sequences in Coding Theory21
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction21
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning21
Information-Theoretic Thresholds for Planted Dense Cycles21
Matroidal Entropy Functions: Constructions, Characterizations, and Representations20
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k20
Limitations on Transversal Gates for Hypergraph Product Codes20
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set20
A Variational Principle for the Metric Mean Dimension of Level Sets20
On the Cost of Consecutive Estimation Error: Significance-Aware Non-Linear Aging20
Memory AMP19
IEEE Transactions on Information Theory publication information19
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target19
A Deterministic Algorithm for the Capacity of Finite-State Channels19
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures19
An Automated Theorem Proving Framework for Information-Theoretic Results19
Zero-Error Capacity of the Chemical Residual Channel19
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach19
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise19
Generalized Singleton Type Upper Bounds19
Minimax Off-Policy Evaluation for Multi-Armed Bandits19
An Information-Theoretic Framework for Receiver Quantization in Communication19
Table of Contents19
Bounds on MLDR Codes Over ???? pt 19
Asymptotic Bounds on the Rate of Locally Repairable Codes19
A Refinement of Expurgation19
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations19
On Penalization in Stochastic Multi-Armed Bandits18
IEEE Transactions on Information Theory Publication Information18
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes18
Wei’s Duality for Generalized Poset Weight Over Galois Rings18
Neural Estimation and Optimization of Directed Information Over Continuous Spaces18
Information Constrained Optimal Transport: From Talagrand, to Marton, to Cover18
An Information-Theoretic Framework for Out-of-Distribution Generalization With Applications to Stochastic Gradient Langevin Dynamics18
Universality Laws for High-Dimensional Learning With Random Features18
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys18
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches17
Gram–Schmidt Methods for Unsupervised Feature Extraction and Selection17
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications17
Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks17
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric17
Virtual Quantum Markov Chains17
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers17
Reliability Function for Streaming Over a DMC With Feedback17
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning Using Passive Langevin Dynamics17
Pearson Chi-Squared Conditional Randomization Test17
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data17
Schrödinger-Föllmer Sampler17
Private Noisy Side Information Helps to Increase the Capacity of SPIR17
Bounds on Covert Capacity With Sub-Exponential Random Slot Selection17
Tree Density Estimation17
Window-Limited CUSUM for Sequential Change Detection16
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications16
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy16
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment16
Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions16
Concatenated Codes for Multiple Reads of a DNA Sequence16
Flexible Distributed Matrix Multiplication16
Learning From Heterogeneous Data Based on Social Interactions Over Graphs16
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes16
Test-Measured Rényi Divergences16
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation16
On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model15
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy15
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization15
Streaming Codes for Variable-Size Messages15
On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of Information15
The Hermitian Dual Codes of Several Classes of BCH Codes15
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms15
Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes15
Higher-Order Staircase Codes15
Improved Support Recovery in Universal 1-bit Compressed Sensing15
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes15
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements15
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes15
On the Fixed-Length-Burst Levenshtein Ball with Unit Radius15
Quantum Coordination Rates in Multi-User Networks15
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel14
Symplectic Self-Orthogonal Quasi-Cyclic Codes14
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements14
Unsourced Multiple Access With Random User Activity14
Table of Contents14
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances14
Sensitivity Analysis for Binary Sampling Systems via Quantitative Fisher Information Lower Bounds14
Minimax Optimal Q Learning With Nearest Neighbors14
IEEE Transactions on Information Theory Publication Information14
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields14
Limit Distribution Theory for f-Divergences14
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels14
Information Limits of Joint Community Detection and Finite Group Synchronization14
Non-Reed-Solomon Type Cyclic MDS Codes14
Improved Decoding Algorithm of BD-LRPC Codes14
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames14
On L 2-Consistency of Nearest Neighbor Matching14
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing14
Griesmer Type Bounds for Nonlinear Codes and Their Applications14
Analysis of Roth–Lempel Codes14
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access14
Typicality for Stratified Measures14
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel14
On Sampling Continuous-Time AWGN Channels14
Constant L₁-Weight Codes Under L∞-Metric14
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design14
Node Repair on Connected Graphs13
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around13
Quantum Multiple-Access One-Time Pad13
Two-Insertion/Deletion/Substitution Correcting Codes13
Mitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers13
Invertible Low-Divergence Coding13
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays13
Characterizing the Functional Density Power Divergence Class13
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing13
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder13
Maximum-Order Complexity and 2-Adic Complexity13
Entropic Compressibility of Lévy Processes13
Can Non-Signaling Assistance Increase the Degrees of Freedom of a Wireless Network?13
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity13
The First Achievement of a Given Level by a Random Process13
From Letters to Words and Back: Invertible Coding of Stationary Measures13
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models13
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes13
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission13
Error Exponents for Oblivious Relaying and Connections to Source Coding with a Helper13
Clustering-Correcting Codes13
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model12
Free Ride on LDPC Coded Transmission12
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning12
Bounding the Optimal Length of Pliable Index Coding via a Hypergraph-based Approach12
Provable Tradeoffs in Adversarially Robust Classification12
Generic Decoding in the Sum-Rank Metric12
Universal Graph Compression: Stochastic Block Models12
Rate-Distortion-Perception Theory for the Quadratic Wasserstein Space12
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity12
Codes Correcting Two Bursts of Exactly b Deletions12
Incremental Refinements and Multiple Descriptions With Feedback12
Information-Theoretic Analysis of Minimax Excess Risk12
On the Best Lattice Quantizers12
Privacy Amplification and Decoupling Without Smoothing12
On de Bruijn Array Codes—Part I: Nonlinear Codes12
The Isometry-Dual Property in Flags of Two-Point Algebraic Geometry Codes12
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels12
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods12
Group Testing With Correlation Under Edge-Faulty Graphs12
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns12
List Decoding Random Euclidean Codes and Infinite Constellations12
Self-Orthogonal Codes From p-Divisible Codes12
Exponential Savings in Agnostic Active Learning Through Abstention12
Minimax Converse for Identification via Channels12
Quantum Ruzsa Divergence to Quantify Magic12
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes12
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances12
Novel One-Shot Inner Bounds for Unassisted Fully Quantum Channels via Rate Splitting11
The Weight Spectrum of the Reed-Muller Codes RM(m – 5,m)11
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing11
Topological Invariants for Linear Codes and APN Functions11
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors11
Decoding Nonbinary LDPC Codes via Proximal-ADMM Approach11
Is Speckle Noise More Challenging to Mitigate Than Additive Noise?11
DNA-Correcting Codes: End-to-End Correction in DNA Storage Systems11
Space Complexity of Euclidean Clustering11
Estimation of a Function of Low Local Dimensionality by Deep Neural Networks11
Coset Error Pattern in Projection-Aggregation Decoding11
Non-Asymptotic Guarantees for Reliable Identification of Granger Causality via the LASSO11
0.052109003067017