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
Successive Refinement With Decoder Cooperation and Its Channel Coding Duals2013
The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders2013
The Entropy of Conditional Markov Trajectories2013
The Generalization Ability of Online Algorithms for Dependent Data2013
The Improved Bounds of Restricted Isometry Constant for Recovery via ℓp-Minimization2013
The Multiway Relay Channel2013
The Principle of Maximum Causal Entropy for Estimating Interacting Processes2013
The Sample Complexity of Search Over Multiple Populations2013
The Secrecy Capacity Region of the Gaussian MIMO Broadcast Channel2013
Threshold Saturation for Spatially-Coupled LDPC and LDGM Codes on BMS Channels2013
Throughput-Delay Analysis of Random Linear Network Coding for Wireless Broadcasting2013
Timely Throughput of Heterogeneous Wireless Networks: Fundamental Limits and Algorithms2013
Time-Space Constrained Codes for Phase-Change Memories2013
Tree-Structure Expectation Propagation for LDPC Decoding Over the BEC2013
Two Birds and One Stone: Gaussian Interference Channel With a Shared Out-of-Band Relay of Limited Rate2013
Two-Unicast Wireless Networks: Characterizing the Degrees of Freedom2013
Two-User Interference Channels With Local Views: On Capacity Regions of TDM-Dominating Policies2013
Universal Codes From Switching Strategies2013
Universal Estimation of Directed Information2013
Upper Bounds on Matching Families in BBZpqn2013
Upper Bounds on Matching Families in <formula formulatype="inline"> <tex Notation="TeX">$\BBZ_{pq}^{n}$</tex></formula>2013
Upper Bounds on the Capacity of Binary Channels With Causal Adversaries2013
Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing2013
Vector Gaussian Two-Terminal Source Coding2013
Wireless MIMO Switching: Weighted Sum Mean Square Error and Sum Rate Optimization2013
Worst-Case Additive Noise in Wireless Networks2013
Worst-Case Expected-Capacity Loss of Slow-Fading Channels2013
Achievable Rates for K-User Gaussian Interference Channels2012
A Class of Optimal Frequency Hopping Sequences with New Parameters2012
A Coordinate System for Gaussian Networks2012
Adaptive Sensing of Congested Spectrum Bands2012
A Geometric Approach to Low-Rank Matrix Completion2012
Analog Product Codes Decodable by Linear Programming2012
Analysis and Design of Tuned Turbo Codes2012
An Efficient Embedder for BCH Coding for Steganography2012
An Improved Nyquist-Shannon Irregular Sampling Theorem From Local Averages2012
An Information-Theoretic Characterization of Channels That Die2012
An Upper Bound on Multihop Transmission Capacity With Dynamic Routing Selection2012
Aperiodic Sequences With Uniformly Decaying Correlations With Applications to Compressed Sensing and System Identification2012
Approximately Optimal Wireless Broadcasting2012
Array Gain in the DMT Framework for MIMO Channels2012
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields2012
Asymptotic Stability Region of Slotted Aloha2012
Boolean Compressed Sensing and Noisy Group Testing2012
Bounding the Coding Advantage of Combination Network Coding in Undirected Networks2012
Bounds on the Capacity of Discrete Memoryless Channels Corrupted by Synchronization and Substitution Errors2012
Caching in Wireless Networks2012
Capacity Region of Vector Gaussian Interference Channels With Generally Strong Interference2012
Cascade and Triangular Source Coding With Side Information at the First Two Nodes2012
Cascade, Triangular, and Two-Way Source Coding With Degraded Side Information at the Second User2012

« prev Page 49/80 next »