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
Relaxation algorithms for MAP estimation of gray-level images with multiplicative noise1990
The hardness of decoding linear codes with preprocessing1990
Worst-case interactive communication I: Two messages are almost optimal1990
Decentralized sequential detection1989
Linear and logarithmic capacities in associative neural networks1989
Lower bounds on estimator performance for energy-invariant parameters of multidimensional Poisson processes1989
Optimal pruning with applications to tree-structured source coding and modeling1989
Optimum linear causal coding schemes for Gaussian stochastic processes in the presence of correlated jamming1989
The capacity of the Kanerva associative memory1989
Balancing sets of vectors1988
Decision tree design from a communication theory standpoint1988
Fine quantization in signal detection and estimation1988
Neural networks, orientations of the hypercube, and algebraic threshold functions1988
Poisson models and mean-squared error for correlator estimators of time delay1988
Self-avoiding random loops1988
Signal detection in fractional Gaussian noise1988
Two-dimensional spectrum estimation using noncausal autoregressive models1986
A complete characterization of minimax and maximin encoder- decoder policies for communication channels with incomplete statistical description1985
A model-based approach for estimation of two-dimensional maximum entropy power spectra1985
Asymptotic relative efficiencies of multistage tests1985
Asymptotic relative efficiencies of multistage tests (Corresp.)1985
Minimax discrimination for observed Poisson processes with uncertain rate functions1985
On minimax robustness: A general approach and applications1984
On the p-point uncertainty class1984
On the p-point uncertainty class (Corresp.)1984
Optimal smoother for discrete time point processes with finite-state Markov rate (Corresp.)1984
Robust Wiener- Kolmogorov theory1984
Robust Wiener-Kolmogorov theory1984
Correction to 'Estimation and choice of Neighbors in Spatial-Interaction Models of Images'1983
Estimation and choice of neighbors in spatial-interaction models of images1983
On the security of public key protocols1983
Robust matched filters1983
The Gaussian test channel with an intelligent jammer1983
Asymptotic efficiencies of truncated sequential tests1982
Least squares quantization in PCM1982
Signal detection in the presence of weakly dependent noise--II: Robust detection1982
Signal detection in the presence of weakly dependent noise--I: Optimum detection1982
Signal detection in the presence of weakly dependent noise. I Optimum detection. II - Robust detection1982
The capacity of the semideterministic relay channel1982
The rate-distortion function on classes of sources determined by spectral capacities1982
A recursive approach to low complexity codes1981
Stochastic models for closed boundary analysis: Representation and reconstruction1981
A general relationship between two quantizer design criteria (Corresp.)1980
An efficient algorithm for constructing nearly optimal prefix codes1980
A two-dimensional maximum entropy spectral estimator1980
Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy1980
Memoryless quantizer- detectors for constant signals in m-dependent noise1980
Performance bounds and optimal linear coding for discrete-time multichannel communication systems (Corresp.)1980
Robust decision design using a distance criterion1980
Memoryless discrete-time detection of a constant signal in m-dependent noise1979

« prev Page 79/80 next »