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
A note on rearrangements, spectral concentration, and the zero-order prolate spheroidal wavefunction1993
Asymptotic properties of data compression and suffix trees1993
Decentralized sequential detection with a fusion center performing the sequential test1993
Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function1993
Dynamic server allocation to parallel queues with randomly varying connectivity1993
Nonparametric cyclic- polyspectral analysis of AM signals and processes with missing observations1993
On loss functions which minimize to conditional expected values and posterior proba- bilities1993
On the construction of systematic tEC/AUED codes1993
Privacy, additional information and communication1993
Quantizer monotonicities and globally optimal scalar quantizer design1993
Random interactions in higher order neural networks1993
Rate-distortion bound for a class of non-Gaussian sources with memory1993
Three results on interactive communication1993
Using combinatorial optimization to design good unit-memory convolutional codes1993
Vector quantization with complexity costs1993
Wavelet transforms associated with finite cyclic groups1993
A unifying maximum-likelihood view of cumulant and polyspectral measures for non-Gaussian signal classification and estimation1992
Average-case interactive communication1992
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs1992
Density estimation by stochastic complexity1992
Entropy-based algorithms for best basis selection1992
Image coding by adaptive tree-structured segmentation1992
Introduction to the special issue on wavelet transforms and multiresolution signal analysis1992
Jointly optimal routing and scheduling in packet radio networks1992
Localized measurement of emergent image frequencies by Gabor wavelets1992
On convergence of Lloyd's method I1992
On the asymptotic convergence of B-spline wavelets to Gabor functions1992
On the asymptotic efficiencies of robust detectors1992
Polynomial spline signal approximations: Filter design and asymptotic equivalence with Shannon's sampling theorem1992
Shiftable multiscale transforms1992
Singularity detection and processing with wavelets1992
Wavelet-based representations for a class of self-similar signals with application to fractal modulation1992
Analysis of digital tries with Markovian dependency1991
Efficient estimation of Class A noise parameters via the EM algorithm1991
Identification of MISO nonlinear regressions in the presence of a wide class of disturbances1991
Minimum complexity density estimation1991
Optimal bi-level quantization and its application to multilevel quantization1991
Timing estimation for a filtered Poisson process in Gaussian noise1991
Worst-case interactive communication - II: Two messages are not optimal1991
Zero-crossings of a wavelet transform1991
A Karhunen-Loève-like expansion for 1/f processes via wavelets1990
An RKHS approach to robust L2 estimation and signal detection1990
Average and randomized communication complexity1990
Bounds on maximum throughput for digital communications with finite-precision and amplitude constraints1990
Lower bounds for parametric estimation with constraints1990
Monotonicity properties for the stochastic knapsack1990
Noncausal 2-D spectrum estimation for direction finding1990
On graphs in which the Shannon capacity is unachievable by finite product1990
On the number of spurious memories in the Hopfield model (neural network)1990
Recursive algorithms for identification of impulsive noise channels1990

« prev Page 78/80 next »