IEEE Trans. Information Theory

3,965 papers1,414 directions
IEEE Transactions on Information Theory (2016) serves as a venue for research at the intersection of information theory, mathematics, and theoretical computer science. While its primary focus is the fundamental limits of information transmission and processing, the 2016 volume includes contributions to the theoretical foundations of machine learning and signal processing. Research published during this period addresses complex algorithmic challenges through a mathematical lens, focusing on the convergence properties and statistical limits of computational methods. The research directions represented in this venue cover a range of topics relevant to modern AI and data systems. Key areas include the analysis of message-passing algorithms, such as Generalized Approximate Message Passing (GAMP), and the development of methods for estimating directed information and testing causality. The venue also features work on distributed systems, specifically regarding optimal locally repairable codes, batch codes, and caching-aided multicasting. These contributions are relevant to the efficiency and reliability of distributed storage and communication networks. In the context of machine learning, the venue explores high-dimensional statistics and optimization, exemplified by research into group-sparse model selection and its associated computational relaxations. Prolific contributors to this volume include researchers such as Alexandros G. Dimakis, Volkan Cevher, and Dimitris S. Papailiopoulos. By bridging the gap between information-theoretic bounds and algorithmic implementation, the venue provides a theoretical framework for advancing data recovery, quantum communication, and statistical inference.

Papers by Year

2026 89
2025 186
2024 204
2023 212
2022 220
2021 240
2020 241
2019 258
2018 267
2017 284
2016 256
2015 231
2014 257
2013 236
2012 205
2011 207
2010 178
2009 134
2008 136
2007 107
2006 114
2005 90
2004 74
2003 67
2002 46
2001 44
2000 38
1999 39
1998 33
1997 24
1996 16
1995 17
1994 19
1993 17
1992 16
1991 8
1990 13
1989 6
1988 7
1986 1
1985 5
1984 6
1983 5
1982 7
1981 2
1980 7
1979 4
1978 2
1976 2
1975 1
1972 1
1969 1
1966 2
1963 1
1956 1
1955 1

Top Research Directions

Research directions most represented by papers from this venue.

From Non-Constructive Existence to Explicit Code Constructions 69
Overcoming Idealized Assumptions in Channel Modeling 41
Generalizing Network Algorithms to Arbitrary Topologies 40
The Empirical Validation Gap 37
Information-Theoretic Converse Bounds for Networks 36
The Scalability Bottleneck of Multi User Interference Management 35
The Statistical Computational Gap in High Dimensions 31
Compress and Forward Relaying with Side Information 30
The Finite Blocklength Performance Gap 30
Optimizing Repair Bandwidth for Distributed Erasure Codes 28
Beyond the Symmetric Channel Assumption in Wireless Networks 27
Generalizing Information Theory to Continuous Alphabets 26
Information Theory for Short Packet Wireless Communications 26
Modular Separation of Source and Channel Coding 25
Generalizing Beyond the Gaussian Noise Assumption 25

Top Authors

AuthorPapers
Tsachy Weissman82
Vincent Y. F. Tan75
H. Vincent Poor49
Vahid Tarokh43
Ashish J Khisti40
Alfred O. Hero37
Jun Chen37
Yingbin Liang36
Yury Polyanskiy36
Chao Tian35
Ayfer Ozgur34
Antonia Wachter-Zeh31
Deniz Gunduz29
Lifeng Lai29
Jonathan Scarlett28
Martin J Wainwright28
Christina Fragouli27
Georgios B. Giannakis27
Pablo Piantanida25
Wei Yu24

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
The Subfield Codes and Subfield Subcodes of a Family of MDS Codes2022
The Undecidability of Conditional Affine Information Inequalities and Conditional Independence Implication With a Binary Constraint2022
The Wavelet Compressibility of Compound Poisson Processes2022
Thomson's Multitaper Method Revisited2022
Time Series Forecasting via Learning Convolutionally Low-Rank Models2022
Topological Interference Management With Confidential Messages2022
Transfer Meta-Learning: Information- Theoretic Bounds and Information Meta-Risk Minimization2022
Transmit Correlation Diversity: Generalization, New Techniques, and Improved Bounds2022
Uncertainty-of-Information Scheduling: A Restless Multiarmed Bandit Framework2022
Uncoded Caching and Cross-Level Coded Delivery for Non-Uniform File Popularity2022
Universal Consistency of Deep Convolutional Neural Networks2022
Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources2022
vqSGD: Vector Quantized Stochastic Gradient Descent2022
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels2022
A Bayesian Approach to Sequential Change Detection and Isolation Problems2021
Adaptive Path Interpolation Method for Sparse Systems: Application to a Censored Block Model2021
Adaptive Social Learning2021
Adversarial Risk via Optimal Transport and Optimal Couplings2021
Algorithmic Analysis and Statistical Estimation of SLOPE via Approximate Message Passing2021
Algorithmic Computability of the Signal Bandwidth2021
Algorithms for Reconstruction Over Single and Multiple Deletion Channels2021
Almost-Reed-Muller Codes Achieve Constant Rates for Random Errors2021
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels2021
Analysis of the Convergence Speed of the Arimoto-Blahut Algorithm by the Second-Order Recurrence Formula2021
A New Achievable Rate-Distortion Region for Distributed Source Coding2021
A New Concept of Fractional Order Cumulant and It-Based Signal Processing in α and/or Gaussian Noise2021
An Upgrading Algorithm With Optimal Power Law2021
A Permutation-Based Model for Crowd Labeling: Optimal Estimation and Robustness2021
Asymmetric Leaky Private Information Retrieval2021
Asymptotically Optimal One- and Two-Sample Testing With Kernels2021
Asymptotically Scale-Invariant Multi-Resolution Quantization2021
Asymptotic Convergence Rates of the Length of the Longest Run(s) in an Inflating Bernoulli Net2021
Asymptotic Properties of Recursive Particle Maximum Likelihood Estimation2021
A Unified Framework for One-Shot Achievability via the Poisson Matching Lemma2021
Benefits of Jointly Training Autoencoders: An Improved Neural Tangent Kernel Analysis2021
Binary Classification With XOR Queries: Fundamental Limits and an Efficient Algorithm2021
Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels2021
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs2021
Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding2021
Capacity Limits of Full-Duplex Cellular Network2021
CodedSketch: A Coding Scheme for Distributed Computation of Approximated Matrix Multiplication2021
Communication Complexity of Distributed High Dimensional Correlation Testing2021
Consistent Risk Estimation in Moderately High-Dimensional Linear Regression2021
Construction of MDS Euclidean Self-Dual Codes via Two Subsets2021
Convergence Rate of Empirical Spectral Distribution of Random Matrices From Linear Codes2021
Coordination Through Shared Randomness2021
Correcting a Single Indel/Edit for DNA-Based Data Storage: Linear-Time Encoders and Order-Optimality2021
Covering Codes Using Insertions or Deletions2021
Covert Communication Over Adversarially Jammed Channels2021
Covert Identification Over Binary-Input Discrete Memoryless Channels2021

« prev Page 16/80 next »