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
Sequential signal encoding from noisy measurements using quantizers with dynamic bias control2001
Signal space detection for recording channels with jitter noise2001
Space-Time autocoding2001
The capacity region of broadcast channels with intersymbol interference and colored Gaussian noise2001
The distribution of loop lengths in graphical models for turbo decoding2001
The one-inclusion graph algorithm is near-optimal for the prediction model of learning2001
The redundancy of source coding with a fidelity criterion - Part II: Coding at a fixed rate level with unknown statistics2001
Three space-economical algorithms for calculating minimum-redundancy prefix codes2001
Twofold universal prediction schemes for achieving the finite-state predictability of a noisy individual binary sequence2001
Uncertainty principles and ideal atomic decomposition2001
Universal lossless data compression with side information by using a conditional MPM grammar transform2001
Universal prediction of individual binary sequences in the presence of noise2001
Universal variable-to-fixed length source codes2001
Adaptive joint detection and decoding in flat-fading channels via mixture Kalman filtering2000
A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q)2000
A statistical multiscale framework for Poisson inverse problems2000
Asymptotic average redundancy of Huffman (and other) block codes2000
Asymptotic global confidence regions in parametric shape estimation problems2000
Bounds for the MSE performance of constant modulus estimators2000
Capacity and mutual information of wideband multipath fading channels2000
CDMA systems in fading channels: Admissibility, network capacity, and power control2000
Constructions of authentication codes from algebraic curves over finite fields2000
Correction to "Space-time block codes from orthogonal designs"2000
Correction to "Space-Time codes from orthogonal designs"2000
Cryptanalysis of RSA with private key d less than N0.2922000
Effective interference and effective bandwidth of linear multiuser receivers in asynchronous CDMA systems2000
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models2000
Grammar-based codes: A new class of universal lossless source codes2000
Growth optimal investment in horse race markets with costs2000
Introduction to the special issue on information-theoretic imaging2000
Iterated logarithmic expansions of the pathwise code lengths for exponential families2000
Kullback proximal algorithims for maximum-likelihood estimation2000
Large system performance of linear multiuser receivers in multipath fading channels2000
Linear multiuser receivers in random environments2000
Lossless sliding-block compression of constrained systems2000
Minimum description length induction, Bayesianism, and Kolmogorov complexity2000
Network information flow2000
On the existence and construction of good codes with low peak-to-average power ratios2000
Optimal subband filter banks for multiple description coding2000
Optimum asymptotic multiuser efficiency of randomly spread CDMA2000
Permutation (d, k) codes: Efficient enumerative coding and phrase length distribution shaping2000
Radio-astronomical imaging in the presence of strong radio interference2000
Separation of random number generation and resolvability2000
Shannon-theoretic approach to a Gaussian cellular multiple-access channel with fading2000
Simulated annealing for maximum a Posteriori parameter estimation of hidden Markov models2000
The capacity of wireless networks2000
The undetected error probability threshold of m-out-of-n codes2000
Tiling and adaptive image compression2000
Tracing traitors2000
Universal coding of nonstationary sources2000

« prev Page 74/80 next »