IEEE Transactions on Information Theory

Papers
(The TQCC of IEEE Transactions on Information Theory is 5. 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-04-01 to 2025-04-01.)
ArticleCitations
IEEE Transactions on Information Theory information for authors207
Table of Contents161
Table of Contents127
Erratum to: “From Classical to Quantum: Uniform Continuity Bounds on Entropies in Infinite Dimensions”92
IEEE Transactions on Information Theory Publication Information88
Table of Contents79
Stronger Polarization for the Deletion Channel77
Table of contents76
Generalization Performance of Empirical Risk Minimization on Over-Parameterized Deep ReLU Nets76
Introducing IEEE Collabratec71
TechRxiv: Share Your Preprint Research with the World!62
IEEE Transactions on Information Theory information for authors62
IEEE Transactions on Information Theory publication information60
IEEE Transactions on Information Theory Information for Authors57
Cumulative Residual and Relative Cumulative Residual Fisher Information and Their Properties57
Rack-Aware MSR Codes With Error Correction Capability for Multiple Erasure Tolerance54
Unifying the Brascamp-Lieb Inequality and the Entropy Power Inequality50
State-Dependent DMC With a Causal Helper48
Self-Dual Convolutional Codes47
Optimal Second-Order Rates for Quantum Soft Covering and Privacy Amplification44
Byzantine-Resilient High-Dimensional Federated Learning44
Optimal Short-Term Forecast for Locally Stationary Functional Time Series43
TechRxiv: Share Your Preprint Research with the World!43
Asymptotic Capacity of 1-bit MIMO Fading Channels42
On the Price of Decentralization in Decentralized Detection41
On Restless Linear Bandits41
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map39
Private Read Update Write (PRUW) in Federated Submodel Learning (FSL): Communication Efficient Schemes With and Without Sparsification39
Universal tester for multiple independence testing and classical-quantum arbitrarily varying multiple access channel38
Table of Contents37
IEEE Transactions on Information Theory publication information35
IEEE Transactions on Information Theory Publication Information35
Sequential Classification With Empirically Observed Statistics33
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size32
A Faster Software Implementation of SQIsign32
Estimation and Testing on Independent Not Identically Distributed Observations Based on Rényi’s Pseudodistances31
Bounds and Constructions of Quantum Locally Recoverable Codes From Quantum CSS Codes30
Impossible Differential Cryptanalysis and a Security Evaluation Framework for AND-RX Ciphers30
IEEE Transactions on Information Theory publication information29
Quantum Differential Privacy in the Local Model29
IEEE Transactions on Information Theory publication information28
IEEE Transactions on Information Theory publication information28
IEEE Transactions on Information Theory publication information28
IEEE Transactions on Information Theory information for authors28
On the Capacity Regions of Cloud Radio Access Networks With Limited Orthogonal Fronthaul28
Table of Contents27
Table of contents27
IEEE Transactions on Information Theory publication information27
IEEE Transactions on Information Theory publication information27
New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes27
Proceedings of the IEEE27
Table of contents27
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes26
Minimum Excess Risk in Bayesian Learning26
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints25
Modulated Sparse Superposition Codes for the Complex AWGN Channel25
Table of Contents25
Broadcast Channels With Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability25
Hulls of Reed-Solomon Codes via Algebraic Geometry Codes25
IEEE Transactions on Information Theory information for authors24
Divergence Maximizing Linear Projection for Supervised Dimension Reduction24
IEEE Transactions on Information Theory publication information24
Tight Exponential Strong Converse for Source Coding Problem With Encoded Side Information24
Table of Contents24
Erasures in Channel Polarization24
IEEE Transactions on Information Theory information for authors23
Universal Polarization for Processes With Memory23
Service Rate Region: A New Aspect of Coded Distributed System Design23
Access-Redundancy Tradeoffs in Quantized Linear Computations23
Random Periodic Sampling Patterns for Shift-Invariant Spaces23
Existence and Size of the Giant Component in Inhomogeneous Random K-Out Graphs23
The Weight Enumerator Polynomials of the Lifted Codes of the Projective Solomon-Stiffler Codes23
Two Applications of Coset Cardinality Spectrum of Distributed Arithmetic Coding23
Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors23
Coding for Sequence Reconstruction for Single Edits22
Algorithms for Constructing Balanced Plateaued Functions With Maximal Algebraic Degrees22
On Lattice Tilings of n by Limited Magnitude Error Balls B(n, 2, 1, 1)22
Classification of Binary Combinatorial Metrics Which Admit MacWilliam’s Extension Theorem21
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes21
The Secrecy Capacity of the Wiretap Channel With Additive Noise and Rate-Limited Help21
Information-Theoretic Characterizations of Generalization Error for the Gibbs Algorithm21
Lipschitz Bandits With Batched Feedback21
The q-Ary Antiprimitive BCH Codes20
Canonical Conditions for K/2 Degrees of Freedom20
On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs20
General Form of Almost Instantaneous Fixed-to-Variable-Length Codes20
Federated Best Arm Identification With Heterogeneous Clients20
Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes20
Equivalence of Three Classical Algorithms With Quantum Side Information: Privacy Amplification, Error Correction, and Data Compression20
Explicit Rate-Optimal Streaming Codes With Smaller Field Size20
Private Index Coding20
Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences20
On Lossy Compression of Directed Graphs19
Epsilon-Nets, Unitary Designs, and Random Quantum Circuits19
Sum-of-Squares Proofs of Logarithmic Sobolev Inequalities on Finite Markov Chains19
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography19
The Extended Codes of a Family of Reversible MDS Cyclic codes19
Finite-State Channels With Feedback and State Known at the Encoder19
Distributed Secret Sharing Over a Public Channel From Correlated Random Variables18
Ideal-Theoretic Explanation of Capacity-Achieving Decoding18
Coding Constructions for Efficient Oblivious Transfer From Noisy Channels18
Scaling Laws for Gaussian Random Many-Access Channels18
Permutation Capacity Region of Adder Multiple-Access Channels18
Sparse Nonnegative Tensor Factorization and Completion With Noisy Observations18
New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes18
Monotonicity of the Trace–Inverse of Covariance Submatrices and Two-Sided Prediction18
Variations on a Theme by Massey18
Signal-to-Noise Ratio Aware Minimaxity and Higher-Order Asymptotics18
Max-Linear Regression by Convex Programming18
Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks18
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets18
Fidelity-Based Smooth Min-Relative Entropy: Properties and Applications17
Individually Conditional Individual Mutual Information Bound on Generalization Error17
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help17
On Rank Energy Statistics via Optimal Transport: Continuity, Convergence, and Change Point Detection17
Shared Information for a Markov Chain on a Tree17
Bent Partitions and LP-Packings17
Adaptive Private Distributed Matrix Multiplication17
On Decoding Binary Quasi-Reversible BCH Codes17
Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity17
Algebraic Geometry Codes in the Sum–Rank Metric17
Binary Sequences With a Low Correlation via Cyclotomic Function Fields17
Corrections to “Concentration Properties of Random Codes”17
Biprojective Almost Perfect Nonlinear Functions16
Joint Beam Allocation and Scheduling for mmWave Cellular Networks16
Fundamental Limits of Reference-Based Sequence Reordering16
Information Rates of the Noisy Nanopore Channel16
Privacy-Preserving Average Consensus: Fundamental Analysis and a Generic Framework Design16
The Plotkin-Type Bound on the Generalized Symbol-Pair Weight and Symbol-Pair Equiweight Codes16
Cache-Aided Matrix Multiplication Retrieval16
Tsallis and Rényi Deformations Linked via a New λ-Duality16
Active Learning via Predictive Normalized Maximum Likelihood Minimization16
Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systems16
Analysis of the Error-Correcting Radius of a Renormalization Decoder for Kitaev’s Toric Code16
The Quantum Multiple-Access Channel With Cribbing Encoders16
Recoverable Systems16
Fundamental Limits of Demand-Private Coded Caching16
On the Duals of Generalized Bent Functions16
The BCH Family of Storage Codes on Triangle-Free Graphs and Its Relation to R(3,t)16
Dimension-Free Noninteractive Simulation From Gaussian Sources16
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha16
Bounds and Constructions for Generalized Batch Codes16
The Feedback Capacity of Noisy Output Is the STate (NOST) Channels15
SDP Achieves Exact Minimax Optimality in Phase Synchronization15
Vectorial Bent Functions With Non-Weakly Regular Components15
Feedback Capacity of Ising Channels With Large Alphabet via Reinforcement Learning15
Multiple-Layer Integrated Interleaved Codes: A Class of Hierarchical Locally Recoverable Codes15
The Gaussian Multiple Access Wiretap Channel With Selfish Transmitters: A Coalitional Game Theory Perspective15
Sum-GDoF of Symmetric Multi-Hop Interference Channel Under Finite Precision CSIT Using Aligned-Images Sum-Set Inequalities15
The Secret Arithmetic of Patterns: A General Method for Designing Constrained Codes Based on Lexicographic Indexing15
On Sure Early Selection of the Best Subset15
The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields15
Macroscopic Analysis of Vector Approximate Message Passing in a Model-Mismatched Setting15
Corrections to “Optimal Streaming Erasure Codes Over the Three-Node Relay Network”15
Competitive Advantage of Huffman and Shannon-Fano Codes15
Optimal Best Arm Identification With Fixed Confidence in Restless Bandits15
The Semiring of Dichotomies and Asymptotic Relative Submajorization15
On the Reliability Function of Discrete Memoryless Multiple-Access Channel With Feedback14
On the Capacity of Channels With Deletions and States14
Typical Error Exponents: A Dual Domain Derivation14
Communicating over a Classical-Quantum MAC with State Information Distributed at the Senders14
An Analysis of Transformed Unadjusted Langevin Algorithm for Heavy-Tailed Sampling14
Higher-Order MDS Codes14
Structural Complexity of One-Dimensional Random Geometric Graphs14
Multivariate Goppa Codes14
Deletions and Insertions of the Symbol “0” and Asymmetric/Unidirectional Error Control Codes for the L Metric14
Streaming Erasure Codes Over Multi-Access Relayed Networks14
IEEE Transactions on Information Theory information for authors14
Tight Lower Bound on the Error Exponent of Classical-Quantum Channels14
Bounds on k-Uniform Quantum States14
Information Rates Over Multi-View Channels14
The Multiple-Access Channel With Entangled Transmitters14
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems14
Orthogonal Approximate Message-Passing for Spatially Coupled Linear Models14
A Rate-Distortion Perspective on Quantum State Redistribution14
Recursive Decoding of Reed-Muller Codes Starting With the Higher-Rate Constituent Code14
Tensor Principal Component Analysis in High Dimensional CP Models14
Quickest Inference of Network Cascades With Noisy Information13
Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks13
Codes Over Trees13
Asymptotic Behaviors and Confidence Intervals for the Number of Operating Sensors in a Sensor Network13
Low Latency Allcast Over Broadcast Erasure Channels13
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information13
Graftage Coding for Distributed Storage Systems13
A Single-Letter Upper Bound to the Mismatch Capacity13
Fundamental Limits of Cache-Aided MIMO Wireless Networks13
On Constructing Bent Functions From Cyclotomic Mappings13
Error-Correcting Codes for Noisy Duplication Channels13
Girth Analysis and Design of Periodically Time-Varying SC-LDPC Codes13
Polar Decreasing Monomial-Cartesian Codes13
On Generalization Bounds for Deep Networks Based on Loss Surface Implicit Regularization13
Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem With Markovity13
A Tight Upper Bound for the Maximal Length of MDS Elliptic Codes13
Bare Quantum Simultaneity Versus Classical Interactivity in Communication Complexity13
Construction of Binary Sequences With Low Correlation via Multiplicative Quadratic Character Over Finite Fields of Odd Characteristics13
De-Biased Sparse PCA: Inference for Eigenstructure of Large Covariance Matrices13
Improved Decoding of Expander Codes13
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima’s Replica Formula)13
On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric13
Analytical Algorithm for Capacities of Classical and Classical-Quantum Channels13
Vector Set Classification by Signal Subspace Matching13
Minimal Binary Linear Codes From Vectorial Boolean Functions13
Breaking the Communication-Privacy-Accuracy Trilemma13
Tradeoff Between Diversity and Multiplexing Gains in Block Fading Optical Wireless Channels12
Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding12
On Coding Over Sliced Information12
Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration, and Lower Bounds12
The Inverse Problem of Positive Autoconvolution12
Concentration Bounds for Plug-In Estimator of Directed Information12
Learning Maximum Margin Channel Decoders12
Online Versus Offline Rate in Streaming Codes for Variable-Size Messages12
Insertion and Deletion Correction in Polymer-Based Data Storage12
What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?12
Detecting an Odd Restless Markov Arm With a Trembling Hand12
Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic12
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime12
Covering Grassmannian Codes: Bounds and Constructions12
A Generic Transformation to Enable Optimal Repair/Access MDS Array Codes With Multiple Repair Degrees12
Exploring Quantum Average-Case Distances: Proofs, Properties, and Examples11
Optimal Additive Quaternary Codes of Low Dimension11
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm11
New Constant Dimension Subspace Codes From the Mixed Dimension Construction11
Commitment Capacity of Classical-Quantum Channels11
WildWood: A New Random Forest Algorithm11
The Broadcast Channel With Degraded Message Sets and Unreliable Conference11
On the Capacity of Communication Channels With Memory and Sampled Additive Cyclostationary Gaussian Noise11
Comments on “Generalized Box-Müller Method for Generating q-Gaussian Random Deviates”11
Moderate Deviation Expansion for Fully Quantum Tasks11
Capacity of Noisy Permutation Channels11
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits11
Reverse Euclidean and Gaussian Isoperimetric Inequalities for Parallel Sets With Applications11
Adaptive Social Learning11
Optimal Change-Point Detection With Training Sequences in the Large and Moderate Deviations Regimes11
Twisted Goppa Codes With an Efficient Decoding Algorithm and Quasi-Cyclic Properties11
On Single Server Private Information Retrieval With Private Coded Side Information11
Universal Densities Exist for Every Finite Reference Measure11
Multi-Marginal Optimal Transport and Probabilistic Graphical Models11
f-Divergences and Their Applications in Lossy Compression and Bounding Generalization Error11
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case11
Quantum CDMA Communication Systems11
Discrete Signaling and Treating Interference as Noise for the Gaussian Interference Channel10
Asymptotic Optimality in Byzantine Distributed Quickest Change Detection10
Replica Analysis of the Linear Model With Markov or Hidden Markov Signal Priors10
On Communication for Distributed Babai Point Computation10
A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes10
Bayesian Two-Stage Sequential Change Diagnosis via Sensor Arrays10
Bounds on the Nonlinearity of Differentially Uniform Functions by Means of Their Image Set Size, and on Their Distance to Affine Functions10
Uplink-Downlink Duality Between Multiple-Access and Broadcast Channels With Compressing Relays10
Template Matching and Change Point Detection by M-Estimation10
Nonparametric Mixture MLEs Under Gaussian-Smoothed Optimal Transport Distance10
0.33744502067566