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
Collusion-Secure Fingerprinting for Digital Data1998
Data Compression and Harmonic Analysis1998
Density Estimation from an Individual Numerical Sequence1998
Design of Shapes for Precise Image Registration1998
Detection of Stochastic Processes1998
Error Bounds for Functional Approximation and Estimation Using Mixtures of Experts1998
Fast Iterative Coding Techniques for Feedback Channels1998
Learning Pattern Classification - A Survey1998
Multiaccess Fading Channels-Part II: Delay-Limited Capacities1998
Multiaccess Fading Channels-Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities1998
Nonparametric Estimation of the Cyclic Cross Spectrum1998
On the Infeasibility of Training Neural Networks with Small Mean-Sqared Error1998
On the Performance of Data Compression Algorithms Based Upon String Matching1998
Sequential Prediction of Individual Sequences Under General Loss Functions1998
Shannon Capacity of M-ary Redundant Multitrack Runlength Limited Codes1998
Source Codes as Random Number Generators1998
Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction1998
Structural Risk Minimization Over Data-Dependent Hierarchies1998
The Importance of Convexity in Learning with Squared Loss1998
The minimum description length principle in coding and modeling1998
The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network1998
Universal Prediction1998
Zero-Error Information Theory1998
Aperiodic autocorrelation and crosscorrelation of polyphase sequences1997
A suboptimal lossy data compression based on approximate pattern matching1997
A subspace algorithm for certain blind identification problems1997
Capacity of fading channels with channel side information1997
Computational power of neural networks: a characterization in terms of Kolmogorov complexity1997
Constructions for difference triangle sets1997
Contribution to Munuera's problem on the main conjecture of geometric hyperelliptic MDS codes1997
Correction to 'A Suboptimal Lossy Data Compression Based on Approximate Pattern Matching'1997
Covering numbers for real-valued function classes1997
Displacement structure and maximum entropy1997
Existence of optimal prefix codes for infinite source alphabets1997
Fixed-slope universal lossy data compression1997
Identification via compressed data1997
Learning decision rules for pattern classification under a family of probability measures1997
On a special class of broadcast channels with confidential messages1997
On the average redundancy rate of the Lempel-Ziv code1997
On the redundancy of the fixed-database Lempel-Ziv algorithm for phi -mixing sources1997
Optimal binary vector quantization via enumeration of covering codes1997
Performance analysis of sequential tests between Poisson processes1997
Probability of error in MMSE multiuser detection1997
Scheduling and performance limits of networks with constantly changing topology1997
Stability analysis of quota allocation access protocols in ring networks with spatial reuse1997
The redundancy of source coding with a fidelity criterion: 1. Known statistics1997
Upper bounds on trellis complexity of lattices1997
A linear time erasure-resilient code with nearly optimal recovery1996
An on-line universal lossy data compression algorithm via continuous codebook refinement - Part II. Optimality for phi-mixing source models1996
A vector quantization approach to universal noiseless coding and quantization1996

« prev Page 76/80 next »