IEEE Transactions on Information Theory

Papers
(The TQCC of IEEE Transactions on Information Theory is 6. 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 2021-12-01 to 2025-12-01.)
ArticleCitations
Template Matching and Change Point Detection by M-Estimation335
Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors217
Random Periodic Sampling Patterns for Shift-Invariant Spaces113
Federated Best Arm Identification With Heterogeneous Clients110
Max-Linear Regression by Convex Programming102
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help98
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets92
Dimension-Free Noninteractive Simulation From Gaussian Sources67
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile63
IEEE Transactions on Information Theory Publication Information56
Table of Contents55
Table of Contents54
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm52
Communicating Over a Classical-Quantum MAC With State Information Distributed at the Senders48
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints43
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation43
IEEE Transactions on Information Theory Information for Authors41
Breaking and Improving a Lattice-Code-Based Cryptosystem by Li, Ling, Xing, and Yeo40
Minimal Binary Linear Codes From Vectorial Boolean Functions37
Improved Decoding Algorithms for MDS and Almost-MDS Codes From Twisted GRS Codes37
A Locality-Based Lens for Coded Computation35
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information34
Hypercontractivity for Quantum Erasure Channels via Variable Multipartite Log-Sobolev Inequality34
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography34
Fast Correlation Attacks on K2 Stream Cipher33
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map32
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)31
Tsallis and Rényi Deformations Linked via a New λ-Duality31
Exact Recovery in the General Hypergraph Stochastic Block Model31
Sharp Variance-Entropy Comparison for Nonnegative Gaussian Quadratic Forms31
Fundamental Limits of Reference-Based Sequence Reordering31
Recoverable Systems31
Information Rates Over Multi-View Channels30
Structural Complexity of One-Dimensional Random Geometric Graphs30
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha30
IEEE Transactions on Information Theory information for authors29
IEEE Transactions on Information Theory Information for Authors29
Distributed Quantum Faithful Simulation and Function Computation Using Algebraic Structured Measurements29
Improved Fast Correlation Attack Using Multiple Linear Approximations and Its Application on SOSEMANUK28
Normalized Delivery Time of Wireless MapReduce28
Table of Contents28
Graph Structure of Chebyshev Permutation Polynomials Over Ring ℤp k28
Variable-Length Feedback Codes Over Known and Unknown Channels With Non-Vanishing Error Probabilities27
IEEE Transactions on Information Theory Information for Authors27
A Variational Principle for the Metric Mean Dimension of Level Sets27
Private Inference in Quantized Models27
Derandomizing Codes for the Adversarial Wiretap Channel of Type II27
Vector Quantization With Error Uniformly Distributed Over an Arbitrary Set27
An Algorithmic Reduction Theory for Binary Codes: LLL and More27
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
Guesswork With Quantum Side Information26
Secure Codes With List Decoding26
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm26
On the Cost of Consecutive Estimation Error: Significance-Aware Non-Linear Aging25
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities25
The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes25
ARMA Processes With Discrete-Continuous Excitation: Compressibility Beyond Sparsity24
Encoder Blind Combinatorial Compressed Sensing24
Unextendible Entanglement of Quantum Channels24
The Number of Nonequivalent Monotone Boolean Functions of 8 Variables23
List-Decoding of AG Codes Without Genus Penalty23
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology23
Majority Logic Decoding for Certain Schubert Codes Using Lines in Schubert Varieties23
On the Number of Inequivalent Monotone Boolean Functions of 9 Variables23
The Generations of Classical Correlations via Quantum Schemes23
Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited23
Limitations on Transversal Gates for Hypergraph Product Codes22
Rethinking Hard Thresholding Pursuit: Full Adaptation and Sharp Estimation22
Distributed Compression of Graphical Data22
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically22
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel22
Multi-Hop Network With Multiple Decision Centers Under Expected-Rate Constraints22
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks22
Extensions of Wei’s Duality Theorem and Bounds for Linear Codes Over ℤͫp22
The Platypus of the Quantum Channel Zoo21
Corrections to “High-Throughput Random Access Using Successive Interference Cancellation in a Tree Algorithm”21
Group Penalized Multinomial Logit Models and Stock Return Direction Prediction21
Random Linear Estimation With Rotationally-Invariant Designs: Asymptotics at High Temperature21
Tight Exponential Analysis for Smoothing the Max-Relative Entropy and for Quantum Privacy Amplification21
Quantum Differentially Private Sparse Regression Learning21
Linear Coding for AWGN Channels With Noisy Output Feedback via Dynamic Programming21
Error-Correction for Sparse Support Recovery Algorithms21
Towards the Optimal Rate Memory Tradeoff in Caching With Coded Placement21
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes21
Encoding Classical Information Into Quantum Resources20
A Lower Bound on the Field Size of Convolutional Codes With a Maximum Distance Profile and an Improved Construction20
Information-Theoretic Thresholds for Planted Dense Cycles20
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target20
Matroidal Entropy Functions: Constructions, Characterizations, and Representations20
Improved Random-Binning Exponent for Distributed Hypothesis Testing20
Inaccuracy Rates for Distributed Inference Over Random Networks With Applications to Social Learning20
An Automated Theorem Proving Framework for Information-Theoretic Results20
Optimal Two-Dimensional Reed–Solomon Codes Correcting Insertions and Deletions20
The Algebraic Characterization of ℳ-Subspaces of Bent Concatenations and Its Application20
Memory AMP19
Log-Concave Sequences in Coding Theory19
Self-Dual Cyclic Codes With Square-Root-Like Lower Bounds on Their Minimum Distances19
Asymptotic Bounds on the Rate of Locally Repairable Codes19
A Refinement of Expurgation19
Covering Radius of Melas Codes19
Zero-Error Capacity of the Chemical Residual Channel19
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach19
Flexible Distributed Matrix Multiplication19
A Deterministic Algorithm for the Capacity of Finite-State Channels19
Bounds on MLDR Codes Over ???? pt 19
IEEE Transactions on Information Theory publication information19
Cross Metaplectic Wigner Distribution: Definition, Properties, Relation to Short-Time Metaplectic Transform, and Uncertainty Principles19
Table of Contents19
Improved Lower Bounds for Strongly Separable Matrices and Related Combinatorial Structures19
Reliable Computation by Large-Alphabet Formulas in the Presence of Noise19
Generalized Singleton Type Upper Bounds19
Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes19
Minimax Off-Policy Evaluation for Multi-Armed Bandits18
IEEE Transactions on Information Theory Publication Information18
Universality Laws for High-Dimensional Learning With Random Features18
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations18
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes18
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 Dynamics17
Learning From Heterogeneous Data Based on Social Interactions Over Graphs17
Round Robin Active Sequential Change Detection for Dependent Multi-Channel Data17
Schrödinger-Föllmer Sampler17
Consistent and Asymptotically Efficient Localization From Range- Difference Measurements17
On Penalization in Stochastic Multi-Armed Bandits17
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches17
Gram–Schmidt Methods for Unsupervised Feature Extraction and Selection17
Reliability Function for Streaming Over a DMC With Feedback17
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys17
Window-Limited CUSUM for Sequential Change Detection17
Wei’s Duality for Generalized Poset Weight Over Galois Rings17
Latency Optimal Storage and Scheduling of Replicated Fragments for Memory Constrained Servers17
Virtual Quantum Markov Chains17
On the Global Optimality of Whittle’s Index Policy for Minimizing the Age of Information16
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation16
Generalized Fisher-Darmois-Koopman-Pitman Theorem and Rao-Blackwell Type Estimators for Power-Law Distributions16
Tree Density Estimation16
Provable Security Evaluations of XOR-Versions of SNOW Family Stream Ciphers Against Fast Correlation Attacks16
Information Limits of Joint Community Detection and Finite Group Synchronization16
Coordinate-Ordering-Free Upper Bounds for Linear Insertion-Deletion Codes16
Concatenated Codes for Multiple Reads of a DNA Sequence16
Context-Tree Weighting and Bayesian Context Trees: Asymptotic and Non-Asymptotic Justifications16
Finite-Sample Bounds for Adaptive Inverse Reinforcement Learning Using Passive Langevin Dynamics16
Test-Measured Rényi Divergences16
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications16
MSR Codes With Linear Field Size and Smallest Sub-Packetization for Any Number of Helper Nodes16
On the Non-Existence of Perfect Codes in the Niederreiter-Rosenbloom-Tsfasman Metric16
Private Noisy Side Information Helps to Increase the Capacity of SPIR16
Bounds on Covert Capacity With Sub-Exponential Random Slot Selection16
Analysis of Roth-Lempel codes15
The Hermitian Dual Codes of Several Classes of BCH Codes15
Improved Support Recovery in Universal 1-bit Compressed Sensing15
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements15
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment15
On the Convergence of Orthogonal/Vector AMP: Long-Memory Message-Passing Strategy15
Diversity/Parallelism Trade-Off in Distributed Systems With Redundancy15
Performance Bounds and Degree-Distribution Optimization of Finite-Length BATS Codes15
On Unique Error Patterns in the Levenshtein’s Sequence Reconstruction Model15
Unsourced Multiple Access With Random User Activity15
Minimax Optimal Q Learning With Nearest Neighbors15
A Bregman Proximal Perspective on Classical and Quantum Blahut-Arimoto Algorithms15
Higher-Order Staircase Codes15
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization15
Limit Distribution Theory for f-Divergences14
Griesmer Type Bounds for Nonlinear Codes and Their Applications14
On L 2-Consistency of Nearest Neighbor Matching14
Streaming Codes for Variable-Size Messages14
Statistically Optimal Estimation of Signals in Modulation Spaces Using Gabor Frames14
Typicality for Stratified Measures14
Constrained Riemannian Noncoherent Constellations for the MIMO Multiple Access Channel14
Information Divergences and Likelihood Ratios of Poisson Processes and Point Patterns14
Pearson Chi-Squared Conditional Randomization Test14
IEEE Transactions on Information Theory Publication Information14
Quantum Coordination Rates in Multi-User Networks14
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel14
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design14
Constructing CM Fields for NFS to Accelerate DL Computation in Non-Prime Finite Fields14
Symplectic Self-Orthogonal Quasi-Cyclic Codes14
Sketching Sparse Low-Rank Matrices With Near-Optimal Sample- and Time-Complexity Using Message Passing14
Constant L₁-Weight Codes Under L∞-Metric14
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes14
On Sampling Continuous-Time AWGN Channels14
On the Fundamental Tradeoff of Integrated Sensing and Communications Under Gaussian Channels14
Privacy Amplification and Decoupling Without Smoothing13
On the Support Recovery of Jointly Sparse Gaussian Sources via Sparse Bayesian Learning13
From Letters to Words and Back: Invertible Coding of Stationary Measures13
Table of Contents13
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access13
Algorithms and Bounds for Complex and Quaternionic Lattices With Application to MIMO Transmission13
Maximum-Order Complexity and 2-Adic Complexity13
Entropic Compressibility of Lévy Processes13
Arithmetic Crosscorrelation of Pseudorandom Binary Sequences of Coprime Periods13
The First Achievement of a Given Level by a Random Process13
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing13
Codes Correcting Two Bursts of Exactly b Deletions13
Non-Reed-Solomon Type Cyclic MDS Codes13
Coded Caching for Two-Dimensional Multi-Access Networks With Cyclic Wrap Around13
Quantum Multiple-Access One-Time Pad13
The Role of Early Sampling in Age of Information Minimization in the Presence of ACK Delays13
Information-Theoretic Analysis of Minimax Excess Risk13
Power-Estimation Trade-Off of Vector-Valued Witsenhausen Counterexample With Causal Decoder13
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes13
Node Repair on Connected Graphs13
Sensitivity Analysis for Binary Sampling Systems via Quantitative Fisher Information Lower Bounds13
Invertible Low-Divergence Coding13
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models13
Characterizing the Functional Density Power Divergence Class13
Two-Insertion/Deletion/Substitution Correcting Codes13
Provable Tradeoffs in Adversarially Robust Classification13
Exponential Savings in Agnostic Active Learning Through Abstention12
Self-Orthogonal Codes From p-Divisible Codes12
Generic Decoding in the Sum-Rank Metric12
The Isometry-Dual Property in Flags of Two-Point Algebraic Geometry Codes12
Universal Graph Compression: Stochastic Block Models12
Mismatched Binary Hypothesis Testing: Error Exponent Sensitivity12
Rate-Distortion-Perception Theory for the Quadratic Wasserstein Space12
On the Intersection of Multiple Insertion (or Deletion) Balls and its Application to List Decoding Under the Reconstruction Model12
List Decoding Random Euclidean Codes and Infinite Constellations12
Incremental Refinements and Multiple Descriptions With Feedback12
Minimax Converse for Identification via Channels12
Decoding Reed–Solomon Skew-Differential Codes12
Clustering-Correcting Codes12
Mitigating Coherent Noise by Balancing Weight-2 Z-Stabilizers12
MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction12
A Unified Framework for Correlation Mining in Ultra-High Dimension12
On the Best Lattice Quantizers12
On de Bruijn Array Codes—Part I: Nonlinear Codes12
Self-Dual Negacyclic Codes With Variable Lengths and Square-Root-Like Lower Bounds on the Minimum Distances12
Free Ride on LDPC Coded Transmission12
Quantum Ruzsa Divergence to Quantify Magic12
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels12
Logical Operators and Fold-Transversal Gates of Bivariate Bicycle Codes12
Storage-Computation-Communication Tradeoff in Distributed Computing: Fundamental Limits and Complexity12
Group Testing With Correlation Under Edge-Faulty Graphs12
Non-Asymptotic Guarantees for Reliable Identification of Granger Causality via the LASSO11
PAC Codes With Bounded-Complexity Sequential Decoding: Pareto Distribution and Code Design11
A New Sieving-Style Information-Set Decoding Algorithm11
Topological Invariants for Linear Codes and APN Functions11
Quadratic Privacy-Signaling Games and the MMSE Information Bottleneck Problem for Gaussian Sources11
Two Conjectures on the Largest Minimum Distances of Binary Self-Orthogonal Codes With Dimension 511
Estimation of a Function of Low Local Dimensionality by Deep Neural Networks11
The Weight Spectrum of the Reed-Muller Codes RM(m – 5,m)11
Constructions and Bounds for Codes With Restricted Overlaps11
Several Families of Ternary Negacyclic Codes and Their Duals11
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors11
Decoding Nonbinary LDPC Codes via Proximal-ADMM Approach11
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing11
Is Speckle Noise More Challenging to Mitigate Than Additive Noise?11
DNA-Correcting Codes: End-to-End Correction in DNA Storage Systems11
0.16533899307251