IEEE Transactions on Information Theory

Papers
(The median citation count of IEEE Transactions on Information Theory is 1. 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-02-01 to 2025-02-01.)
ArticleCitations
IEEE Transactions on Information Theory information for authors133
Table of Contents123
Gray–Wyner and Mutual Information Regions for Doubly Symmetric Binary Sources and Gaussian Sources79
On Hierarchies of Balanced Sequences74
Nonparametric Mixture MLEs Under Gaussian-Smoothed Optimal Transport Distance72
Table of Contents70
Computer Classification of Linear Codes61
Balancing Statistical and Computational Precision: A General Theory and Applications to Sparse Regression56
Max-Linear Regression by Convex Programming54
Finite-State Channels With Feedback and State Known at the Encoder54
Bounds and Constructions of Quantum Locally Recoverable Codes from Quantum CSS Codes52
Broadcast Channels with Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability50
On Constructing Bent Functions From Cyclotomic Mappings49
Table of Contents47
TechRxiv: Share Your Preprint Research with the World!44
Codes Over Trees44
Construction of MDS Euclidean Self-Dual Codes via Two Subsets44
Member Get-A-Member (MGM) Program43
Table of contents42
IEEE Transactions on Information Theory publication information41
Table of contents39
Introducing IEEE Collabratec39
TechRxiv: Share Your Preprint Research with the World!38
Concentration Bounds for Plug-In Estimator of Directed Information36
IEEE Transactions on Information Theory information for authors35
Cumulative Residual and Relative Cumulative Residual Fisher Information and Their Properties34
IEEE Transactions on Information Theory publication information34
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case33
IEEE Transactions on Information Theory Information for Authors33
Rack-Aware MSR Codes With Error Correction Capability for Multiple Erasure Tolerance30
Sparse Nonnegative Tensor Factorization and Completion With Noisy Observations29
Biprojective Almost Perfect Nonlinear Functions29
The q-Ary Antiprimitive BCH Codes29
Multi-Marginal Optimal Transport and Probabilistic Graphical Models28
Two Applications of Coset Cardinality Spectrum of Distributed Arithmetic Coding28
Adaptive Social Learning27
Optimal Change-Point Detection With Training Sequences in the Large and Moderate Deviations Regimes27
Nonconvex Matrix Factorization From Rank-One Measurements27
Robust Mean Estimation in High Dimensions: An Outlier-Fraction Agnostic and Efficient Algorithm27
Data Encoding for Byzantine-Resilient Distributed Optimization27
Comments on “Generalized Box-Müller Method for Generating q-Gaussian Random Deviates”27
Exploring Quantum Average-Case Distances: Proofs, Properties, and Examples26
Rate Region of the One-Help-Two Quadratic Gaussian Source-Coding Problem With Markovity26
On Generalization Bounds for Deep Networks Based on Loss Surface Implicit Regularization26
Low Latency Allcast Over Broadcast Erasure Channels26
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems25
Provable Identifiability of Two-Layer ReLU Neural Networks via LASSO Regularization25
Table of Contents25
The Secrecy Capacity of the Wiretap Channel With Additive Noise and Rate-Limited Help24
On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs24
Covert Identification Over Binary-Input Discrete Memoryless Channels24
Random Periodic Sampling Patterns for Shift-Invariant Spaces23
IEEE Transactions on Information Theory Publication Information23
Tradeoff Between Diversity and Multiplexing Gains in Block Fading Optical Wireless Channels23
IEEE Transactions on Information Theory publication information22
Asymptotic Divergences and Strong Dichotomy22
New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes22
Vector Set Classification by Signal Subspace Matching22
The Quantum Multiple-Access Channel With Cribbing Encoders22
Typical Error Exponents: A Dual Domain Derivation22
Lifted Reed-Solomon Codes and Lifted Multiplicity Codes21
Communication Complexity of Distributed High Dimensional Correlation Testing21
A New Construction of Nonlinear Codes via Rational Function Fields20
Optimal Additive Quaternary Codes of Low Dimension20
Asymptotic Behaviors and Confidence Intervals for the Number of Operating Sensors in a Sensor Network20
The Concavity of Generalized Entropy Powers20
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed–Solomon Codes20
IEEE Transactions on Information Theory publication information20
IEEE Transactions on Information Theory publication information19
Active Learning via Predictive Normalized Maximum Likelihood Minimization19
Advancing the Idea of Probabilistic Neutral Bits: First Key Recovery Attack on 7.5 Round ChaCha19
IEEE Transactions on Information Theory information for authors19
Fundamental Limits of Demand-Private Coded Caching19
IEEE Transactions on Information Theory publication information19
Modulated Sparse Superposition Codes for the Complex AWGN Channel19
A Signal-Space Distance Measure for Nondispersive Optical Fiber18
IEEE Transactions on Information Theory publication information18
An Analysis of Transformed Unadjusted Langevin Algorithm for Heavy-Tailed Sampling18
IEEE Transactions on Information Theory publication information18
Improved Decoding of Expander Codes18
On Decoding Binary Quasi-Reversible BCH Codes18
Proceedings of the IEEE18
Reverse Euclidean and Gaussian Isoperimetric Inequalities for Parallel Sets With Applications18
The Broadcast Channel With Degraded Message Sets and Unreliable Conference18
Table of Contents18
Orthogonal Approximate Message-Passing for Spatially Coupled Linear Models18
Sequence Pairs With Lowest Combined Autocorrelation and Crosscorrelation18
Table of contents18
Coding Constructions for Efficient Oblivious Transfer From Noisy Channels18
An Efficient Framework for Clustered Federated Learning18
Quadratic Secret Sharing and Conditional Disclosure of Secrets18
On the Capacity Regions of Cloud Radio Access Networks With Limited Orthogonal Fronthaul18
Dimension-Free Noninteractive Simulation From Gaussian Sources17
Table of contents17
Existence and Size of the Giant Component in Inhomogeneous Random K-Out Graphs17
Bare Quantum Simultaneity Versus Classical Interactivity in Communication Complexity17
Rigorous State Evolution Analysis for Approximate Message Passing With Side Information17
IEEE Transactions on Information Theory publication information17
Nearly Minimax-Optimal Regret for Linearly Parameterized Bandits17
Joint Beam Allocation and Scheduling for mmWave Cellular Networks17
Feedback Capacity of Ising Channels With Large Alphabet via Reinforcement Learning17
Streaming Erasure Codes Over Multi-Access Relayed Networks17
The Feedback Capacity of Noisy Output Is the STate (NOST) Channels17
Analytical Algorithm for Capacities of Classical and Classical-Quantum Channels16
Universal Densities Exist for Every Finite Reference Measure16
Finite Sample Improvement of Akaike’s Information Criterion16
Fidelity-Based Smooth Min-Relative Entropy: Properties and Applications16
Distributed Secret Sharing Over a Public Channel From Correlated Random Variables16
Classification of Binary Combinatorial Metrics Which Admit MacWilliam’s Extension Theorem16
Notice of Removal: A Novel Representation for Permutations16
Fundamental Structure of Optimal Cache Placement for Coded Caching With Nonuniform Demands16
Fast Syndrome-Based Chase Decoding of Binary BCH Codes Through Wu List Decoding16
Construction of Protograph-Based LDPC Codes With Chordless Short Cycles15
Sum-GDoF of Symmetric Multi-Hop Interference Channel Under Finite Precision CSIT Using Aligned-Images Sum-Set Inequalities15
Distributed Learning With Dependent Samples15
The Weight Enumerator Polynomials of the Lifted Codes of the Projective Solomon-Stiffler Codes15
The Inverse Problem of Positive Autoconvolution15
Deterministic Identification Over Channels With Power Constraints15
The BCH Family of Storage Codes on Triangle-Free Graphs and Its Relation to R(3,t)15
Recoverable Systems15
Graftage Coding for Distributed Storage Systems15
Minimal Binary Linear Codes From Vectorial Boolean Functions15
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime15
Lipschitz Bandits With Batched Feedback15
Uplink-Downlink Duality Between Multiple-Access and Broadcast Channels With Compressing Relays15
Fundamental Limits of Reference-Based Sequence Reordering14
Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration, and Lower Bounds14
On the Minimum Node Degree and k-Connectivity in Inhomogeneous Random K-Out Graphs14
Corrections to “Concentration Properties of Random Codes”14
On the Zero-Error Capacity of the Modulo-Additive Noise Channel With Help14
On Rank Energy Statistics via Optimal Transport: Continuity, Convergence, and Change Point Detection14
Twisted Goppa Codes With an Efficient Decoding Algorithm and Quasi-Cyclic Properties14
Covert Communication Over Adversarially Jammed Channels14
Estimation and Testing on Independent Not Identically Distributed Observations Based on Rényi’s Pseudodistances14
The Extended Codes of a Family of Reversible MDS Cyclic codes14
The Plotkin-Type Bound on the Generalized Symbol-Pair Weight and Symbol-Pair Equiweight Codes14
State-Dependent DMC With a Causal Helper14
Minimum Energy Analysis for Robust Gaussian Joint Source-Channel Coding With a Distortion-Noise Profile14
Tensor Principal Component Analysis in High Dimensional CP Models14
Quaternary Codes and Their Binary Images14
Comments on “Analytical Algorithm for Capacities of Classical and Classical-Quantum Channels”13
Spectral Method for Phase Retrieval: An Expectation Propagation Perspective13
The Secrecy Capacity of Cost-Constrained Wiretap Channels13
Lossy Quantum Source Coding With a Global Error Criterion Based on a Posterior Reference Map13
Secret Key Generation From Vector Gaussian Sources With Public and Private Communications13
Canonical Conditions for K/2 Degrees of Freedom13
The Semiring of Dichotomies and Asymptotic Relative Submajorization13
Binary Sequences With a Low Correlation via Cyclotomic Function Fields13
Corrections to “Optimal Streaming Erasure Codes Over the Three-Node Relay Network”13
What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?13
On the Fundamental Limits of Device-to-Device Private Caching Under Uncoded Cache Placement and User Collusion13
A Few Interactions Improve Distributed Nonparametric Estimation, Optimally13
Fundamental Limits of Cache-Aided MIMO Wireless Networks13
Signal-to-Noise Ratio Aware Minimaxity and Higher-Order Asymptotics13
Bent Partitions and LP-Packings13
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets13
Discrete Signaling and Treating Interference as Noise for the Gaussian Interference Channel13
Recursive Decoding of Reed-Muller Codes Starting With the Higher-Rate Constituent Code13
On Lattice Tilings of n by Limited Magnitude Error Balls B(n, 2, 1, 1)13
Almost-Reed–Muller Codes Achieve Constant Rates for Random Errors13
Construction of Binary Sequences With Low Correlation via Multiplicative Quadratic Character Over Finite Fields of Odd Characteristics13
Several Families of Binary Minimal Linear Codes From Two-to-One Functions13
Algebraic Geometry Codes in the Sum–Rank Metric13
Vector Gaussian Successive Refinement With Degraded Side Information13
Bounds and Constructions of Parent Identifying Schemes via the Algorithmic Version of the Lovász Local Lemma13
Table of Contents13
On Communication for Distributed Babai Point Computation13
Bayesian Two-Stage Sequential Change Diagnosis via Sensor Arrays13
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free12
On the Duals of Generalized Bent Functions12
On the Similarity Between von Neumann Graph Entropy and Structural Information: Interpretation, Computation, and Applications12
Sharp Variance-Entropy Comparison for Nonnegative Gaussian Quadratic Forms12
New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes12
Error-Correcting Codes for Noisy Duplication Channels12
Self-Dual Convolutional Codes12
Privacy-Preserving Average Consensus: Fundamental Analysis and a Generic Framework Design12
Monotonicity of the Trace–Inverse of Covariance Submatrices and Two-Sided Prediction12
Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences12
RQC Revisited and More Cryptanalysis for Rank-Based Cryptography12
Sparse Subspace Clustering via Two-Step Reweighted L1-Minimization: Algorithm and Provable Neighbor Recovery Rates12
Byzantine-Resilient High-Dimensional Federated Learning12
Replica Analysis of the Linear Model With Markov or Hidden Markov Signal Priors12
Compute-and-Forward in Large Relaying Systems: Limitations and Asymptotically Optimal Scheduling12
Tsallis and Rényi Deformations Linked via a New λ-Duality12
Algorithms for Constructing Balanced Plateaued Functions With Maximal Algebraic Degrees12
Provable Compressed Sensing With Generative Priors via Langevin Dynamics12
Breaking the Communication-Privacy-Accuracy Trilemma12
Private Index Coding12
Girth Analysis and Design of Periodically Time-Varying SC-LDPC Codes11
Deletions and Insertions of the Symbol “0” and Asymmetric/Unidirectional Error Control Codes for the L Metric11
IEEE Transactions on Information Theory publication information11
Constructing New APN Functions Through Relative Trace Functions11
Bounds on k-Uniform Quantum States11
Sparse Regression LDPC Codes11
IEEE Transactions on Information Theory information for authors11
On Coding Over Sliced Information11
Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks11
Table of Contents11
Multiple-Layer Integrated Interleaved Codes: A Class of Hierarchical Locally Recoverable Codes11
Reliable Simulation of Quantum Channels: The Error Exponent11
Convolution Type of Metaplectic Cohen’s Distribution Time-Frequency Analysis Theory, Method and Technology11
Capacity of Noisy Permutation Channels11
A Faster Software Implementation of SQIsign11
Variations on a Theme by Massey11
Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks11
Tight Lower Bound on the Error Exponent of Classical-Quantum Channels11
On the Reliability Function of Discrete Memoryless Multiple-Access Channel With Feedback11
Covering Grassmannian Codes: Bounds and Constructions11
Optimal Best Arm Identification With Fixed Confidence in Restless Bandits10
New Constant Dimension Subspace Codes From the Mixed Dimension Construction10
Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference10
Thomson’s Multitaper Method Revisited10
Exact Recovery in the General Hypergraph Stochastic Block Model10
Hulls of Reed-Solomon Codes via Algebraic Geometry Codes10
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size10
Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes10
The Expansion Complexity of Ultimately Periodic Sequences Over Finite Fields10
The Gaussian Multiple Access Wiretap Channel With Selfish Transmitters: A Coalitional Game Theory Perspective10
Analysis of the Error-Correcting Radius of a Renormalization Decoder for Kitaev’s Toric Code10
Graphs of Joint Types, Noninteractive Simulation, and Stronger Hypercontractivity10
IEEE Transactions on Information Theory information for authors10
A Tight Upper Bound for the Maximal Length of MDS Elliptic Codes10
Deep Neural Network Approximation Theory10
Higher-Order MDS Codes10
Fast Correlation Attacks on K2 Stream Cipher10
Analysis of KNN Density Estimation10
Smoothing Codes and Lattices: Systematic Study and New Bounds10
Near-Minimax Optimal Estimation With Shallow ReLU Neural Networks10
New Constructive Counterexamples to Additivity of Minimum Output Rényi p-Entropy of Quantum Channels10
Quantum CDMA Communication Systems10
Polar Decreasing Monomial-Cartesian Codes10
SDP Achieves Exact Minimax Optimality in Phase Synchronization10
Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality10
Impossible Differential Cryptanalysis and a Security Evaluation Framework for AND-RX Ciphers10
Bounds on the Nonlinearity of Differentially Uniform Functions by Means of Their Image Set Size, and on Their Distance to Affine Functions10
IEEE Transactions on Information Theory information for authors10
Equivalence of Three Classical Algorithms With Quantum Side Information: Privacy Amplification, Error Correction, and Data Compression10
Comments on and Corrections to “When Is the Chernoff Exponent for Quantum Operations Finite?”10
Commitment Capacity of Classical-Quantum Channels10
Bounds and Constructions for Generalized Batch Codes10
Structural Complexity of One-Dimensional Random Geometric Graphs9
Duality Between Source Coding With Quantum Side Information and Classical-Quantum Channel Coding9
On Lossy Compression of Directed Graphs9
A Single-Letter Upper Bound to the Mismatch Capacity9
Source Coding for Synthesizing Correlated Randomness9
On the Size of Balls and Anticodes of Small Diameter Under the Fixed-Length Levenshtein Metric9
On the Capacity of Channels With Deletions and States9
A Generic Transformation to Enable Optimal Repair/Access MDS Array Codes With Multiple Repair Degrees9
Asymptotic Optimality in Byzantine Distributed Quickest Change Detection9
Federated Best Arm Identification With Heterogeneous Clients9
0.17696809768677