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
Bandwidth allocation for multiple qualities of service using generalized processor sharing1996
Capacity, mutual information, and coding for finite-state Markov channels1996
Efficient agnostic learning of neural networks with bounded fan-in1996
Extended synchronizing codewords for binary prefix codes1996
New ternary and quaternary linear block codes1996
On a conjecture of Helleseth regarding pairs of binary m-sequences1996
Polyspectral analysis of mixed processes and coupled harmonics1996
Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity1996
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm1996
Source coding and graph entropies1996
Spread-response precoding for communication over fading channels1996
Trellis complexity versus the coding gain of lattices I1996
Trellis complexity versus the coding gain of lattices II1996
A lower bound on the probability of error in multihypothesis testing1995
Asymptotic expansions and rate of convergence in signal detection1995
Asymptotic theory of mixed time averages and k th-order cyclic-moment and cumulant statistics1995
Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm1995
Blind channel identification based on second-order statistics: a frequency-domain approach1995
Convergence analysis of the sign algorithm for adaptive filtering1995
Covering properties of convolutional codes and associated lattices1995
De-noising by soft-thresholding1995
Maximum-likelihood estimation of a class of chaotic signals1995
Multiresolution analysis of a class of nonstationary processes1995
On asymptotics of certain sums arising in coding theory1995
On a technique to calculate the exact performance of a convolutional code1995
Optimal simultaneous detection and estimation under a false alarm constraint1995
Optimum soft-output detection for channels with intersymbol interference1995
Rates of convergence of nearest neighbor estimation under arbitrary sampling1995
Repeated communication and Ramsey graphs1995
Spread-signature CDMA: efficient multiuser communication in the presence of fading1995
A lower bound on the expected length of one-to-one codes1994
A metric entropy bound is not sufficient for learnability1994
An optimum complete orthonormal basis for signal analysis and design1994
A paradigm for class identification problems1994
A progressive universal noiseless coder1994
A recursive algorithm for computing Cramer-Rao- type bounds on estimator covariance1994
Binary prefix codes ending in a "1"1994
Bounds on approximate steepest descent for likelihood maximization in exponential families1994
Data fusion with minimal communication1994
Generating binary sequences for stochastic computing1994
Lower bounds on threshold and related circuits via communication complexity1994
Minimax robust decentralized detection1994
Nonparametric polyspectral estimators for kth-order (almost) cyclostationary processes1994
On sequential delay estimation in wideband digital communication systems1994
On the finite sample performance of the nearest neighbor classifier1994
On two-dimensional spectral realization1994
Rational approximation techniques for analysis of neural networks1994
Sequential amplitude estimation in multiuser communications1994
Variable-rate source coding theorems for stationary nonergodic sources1994
A coding scheme for single peak-shift correction in (d, k)-constrained channels1993

« prev Page 77/80 next »