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 Minimax Robust Detection of Stationary Gaussian Signals in White Gaussian Noise2011
On the Capacity and Diversity-Multiplexing Tradeoff of the Two-Way Relay Channel2011
On the Capacity of Noncoherent Network Coding2011
On the Capacity of Type I Broadcast-Z-Interference Channels2011
On the Complexity Distribution of Sphere Decoding2011
On the Equivalence of Two Achievable Regions for the Broadcast Channel2011
On the Number of Errors Correctable with Codes on Graphs2011
On the Performance of Sparse Recovery Via lp-Minimization (0 <= p <= 1)2011
On the Role of Queue Length Information in Network Control2011
On the Role of the Refinement Layer in Multiple Description Coding and Scalable Coding2011
On the Secure Degrees of Freedom of Relaying With Half-Duplex Feedback2011
On Throughput Optimality With Delayed Network-State Information2011
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction2011
Optimally Sparse Frames2011
Optimal Resource Allocation for MIMO Ad Hoc Cognitive Radio Networks2011
Optimal Ternary Constant-Composition Codes of Weight Four and Distance Five2011
Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise2011
Outage Analysis of Block-Fading Gaussian Interference Channels2011
Peer-to-Peer Streaming Capacity2011
Performance Analysis of 3-D Turbo Codes2011
Performance of LDPC Codes Under Faulty Iterative Decoding2011
Performance of Statistical Tests for Single-Source Detection Using Random Matrix Theory2011
Precise Stability Phase Transitions for 1 Minimization: A Unified Geometric Framework2011
Probability Estimation in the Rare-Events Regime2011
Probing Capacity2011
Quantum Algorithms for Testing Properties of Distributions2011
Quickest Search Over Multiple Sequences2011
Rate Distortion Theory for Causal Video Coding: Characterization, Computation Algorithm, and Comparison2011
Resource Allocation for Wireless Multiuser OFDM Networks2011
Robust Communication via Decentralized Processing With Unreliable Backhaul Links2011
Robust Matrix Decomposition With Sparse Corruptions2011
Rumors in a Network: Who's the Culprit?2011
Secrecy Throughput of MANETs Under Passive and Active Attacks2011
Securing Dynamic Distributed Storage Systems Against Eavesdropping and Adversarial Attacks2011
Sequential Quantile Prediction of Time Series2011
Shannon Meets Nash on the Interference Channel2011
Sharp Oracle Inequalities for High-Dimensional Matrix Prediction2011
Slepian-Wolf Coding Over Cooperative Relay Networks2011
Soft Decoding, Dual BCH Codes, and Better List-Decodable varepsilon-Biased Codes.2011
Source Coding With a Side Information "Vending Machine"2011
Sparse Recovery From Combined Fusion Frame Measurements2011
Sparse Recovery With Orthogonal Matching Pursuit Under RIP2011
Spectral Distribution of Random Matrices From Binary Linear Block Codes2011
Stopping Set Distributions of Some Reed-Muller Codes2011
Strongly Consistent Estimation of the Sample Distribution of Noisy Continuous-Parameter Fields2011
Structural Models for Dual Modality Data With Application to Network Tomography2011
Symmetric Semideterministic Relay Networks With No Interference at the Relays2011
The Achievable Distortion Region of Sending a Bivariate Gaussian Source on the Gaussian Broadcast Channel2011
The Burbea-Rao and Bhattacharyya Centroids2011
The Capacity of Several New Classes of Semi-Deterministic Relay Channels2011

« prev Page 55/80 next »