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
On the Large Deviations of Resequencing Queue Size: 2-M/M/1 Case2008
On the Optimality of the ARQ-DDF Protocol2008
On the Optimality of the ARQ-DDF Protocol.2008
On the Performance of Clustering in Hilbert Spaces2008
On the Secrecy Capacity of Fading Channels2008
On the Subexponential Decay of Detection Error Probabilities in Long Tandems2008
On the Uniqueness of Nonnegative Sparse Solutions to Underdetermined Systems of Equations2008
On Unique Decodability2008
Optimal Delay-Throughput Tradeoffs in Mobile Ad Hoc Networks2008
Optimal Sequential Frame Synchronization2008
Packing and Covering Properties of Rank Metric Codes2008
Parameter Estimation of Quantum Channels2008
Performance Bounds for Bidirectional Coded Cooperation Protocols2008
Permutation Decoding and the Stopping Redundancy Hierarchy of Cyclic and Extended Cyclic Codes2008
Power-Efficient Resource Allocation for Time-Division Multiple Access Over Fading Channels2008
Probabilistic Analysis of Linear Programming Decoding.2008
Product Multicommodity Flow in Wireless Networks2008
Rainbow Network Flow of Multiple Description Codes2008
Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem2008
Resilient Network Coding in the Presence of Byzantine Adversaries2008
Robust Distributed Source Coding2008
Scanning and Sequential Decision Making for Multidimensional Data - Part II: The Noisy Case2008
Secure Broadcasting Over Fading Channels2008
Secure Communication Over Fading Channels2008
Sharp Bounds for Optimal Decoding of Low Density Parity Check Codes2008
Side-Information Scalable Source Coding2008
Skipping, Cascade, and Combined Chain Schemes for Broadcast Encryption2008
Source Coding With Distortion Side Information2008
Stability Results for Random Sampling of Sparse Trigonometric Polynomials2008
Statistical Analysis of Bayes Optimal Subset Ranking2008
Successive Refinement for Hypothesis Testing and Lossless One-Helper Problem2008
Successive Refinement Via Broadcast: Optimizing Expected Distortion of a Gaussian Source Over a Gaussian Fading Channel2008
Successive Wyner-Ziv Coding Scheme and Its Application to the Quadratic Gaussian CEO Problem2008
The Impact of Stochastic Noisy Feedback on Distributed Network Utility Maximization2008
The Information Lost in Erasures2008
The Relay-Eavesdropper Channel: Cooperation for Secrecy2008
The Sizes of Optimal q -Ary Codes of Weight Three and Distance Four: A Complete Solution2008
The Structure of General Interference Functions and Applications2008
The Water-Filling Game in Fading Multiple-Access Channels2008
The Wiretap Channel With Feedback: Encryption Over the Channel2008
Throughput of Low-Power Cellular Systems With Collaborative Base Stations and Relaying2008
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models2008
Tracking the Best Quantizer.2008
Uncoded Transmission Is Exactly Optimal for a Simple Gaussian “Sensor” Network2008
Undersmoothed Kernel Entropy Estimators2008
Universal Denoising of Discrete-Time Continuous-Amplitude Signals2008
Universal Filtering Via Hidden Markov Modeling2008
Universal Multiterminal Source Coding Algorithms With Asymptotically Zero Feedback: Fixed Database Case2008
Use and Subtleties of Saddlepoint Approximation for Minimum Mean-Square Error Estimation2008
Why Do Block Length and Delay Behave Differently if Feedback Is Present?2008

« prev Page 63/80 next »