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
Generalization Performance of Empirical Risk Minimization on Over-Parameterized Deep ReLU Nets2025
Generalized Fractional Repetition Codes for Binary Coded Computations2025
Generalized GM-MDS: Polynomial Codes Are Higher Order MDS2025
Global and Local CLTs for Linear Spectral Statistics of General Sample Covariance Matrices When the Dimension Is Much Larger Than the Sample Size With Applications2025
Global Phaseless Sampling in Spline Spaces With Arbitrary Knots2025
Griesmer Type Bounds for Nonlinear Codes and Their Applications2025
Grouping-Based Cyclic Scheduling Under Age of Correlated Information Constraints2025
How Does Distribution Matching Help Domain Generalization: An Information-Theoretic Analysis2025
Implicit Balancing and Regularization: Generalization and Convergence Guarantees for Overparameterized Asymmetric Matrix Sensing2025
Improved Turbo Message Passing for Compressive Robust Principal Component Analysis: Algorithm Design and Asymptotic Analysis2025
Information Rates Over Multi-View Channels2025
Information-Theoretic Generalization Bounds for Deep Neural Networks2025
Information-Theoretic Thresholds for the Alignments of Partially Correlated Graphs2025
Interference Networks With Random User Activity and Heterogeneous Delay Constraints2025
Is Speckle Noise More Challenging to Mitigate Than Additive Noise?2025
Linearized Reed-Solomon Codes With Support-Constrained Generator Matrix and Applications in Multi-Source Network Coding2025
Maximal-Capacity Discrete Memoryless Channel Identification2025
Mean Estimation Under Heterogeneous Privacy Demands2025
Memory Complexity of Estimating Entropy and Mutual Information2025
Minimax Estimation of Linear Functions of Eigenvectors in the Face of Small Eigen-Gaps2025
Minimax Hypothesis Testing for the Bradley-Terry-Luce Model2025
Minimax Optimal Q Learning With Nearest Neighbors2025
Model Free Prediction With Uncertainty Assessment2025
Model Non-Collapse: Minimax Bounds for Recursive Discrete Distribution Estimation2025
Multi-Armed Bandits With Costly Probes2025
Multiset Combinatorial Gray Codes With Application to Proximity Sensor Networks2025
Multivariate Analytic Combinatorics for Cost Constrained Channels2025
New Bounds for Generalized Column Distances and Construction of Convolutional Codes2025
New Constructions of q-Ary MDS Array Codes Derived From Fq[x]/xm + λ and Their Efficient Erasure Encoding/Decoding2025
New MRA Schemes Based on the CRT for Polynomial Rings2025
Next-Token Prediction Capacity: General Upper Bounds and a Lower Bound for Transformers2025
Non-Coherent Rayleigh Fading Channels: Properties of the Capacity-Achieving Input2025
On Confidence Sequences for Bounded Random Processes via Universal Gambling Strategies2025
On de Bruijn Array Codes - Part I: Nonlinear Codes2025
One-Shot Coding Over General Noisy Networks2025
One-Shot Distributed Source Simulation: As Quantum as It Can Get2025
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction2025
Online Information Compression of Finite-Valued Networks via Finite Automata Approach and Reinforcement Learning2025
Online Multiple Changepoint Detection With False Discovery Rate Control2025
On (ℒ, 풫)-Twisted Generalized Reed-Solomon Codes2025
On Non-Interactive Simulation of Distributed Sources With Finite Alphabets2025
On Penalization in Stochastic Multi-Armed Bandits2025
On Strong Secrecy for Multiple Access Channels With States and Causal CSI2025
On the Additivity of Optimal Rates for Independent Zero-Error Source and Channel Problems2025
On the Amount of Randomness Needed for Improving Distributed Wireless Link Scheduling Under Arbitrary Interference2025
On the Best Approximation by Finite Gaussian Mixtures2025
On the b-Symbol Distances of Matrix Product Codes, Constacyclic Codes, and Reed-Muller Codes2025
On the Convergence of (Stochastic) Gradient Descent for Kolmogorov-Arnold Networks2025
On the Reliability Function of Discrete Memoryless Multiple-Access Channel With Feedback2025
Optimal Codes Correcting a Substring Edit2025

« prev Page 4/80 next »