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
Spatial Reuse and Fairness of Ad Hoc Networks With Channel-Aware CSMA Protocols2014
Strong data processing inequalities and $Φ$-Sobolev inequalities for discrete channels2014
Sufficient Conditions on the Optimality of Myopic Sensing in Opportunistic Channel Access: A Unifying Framework2014
Support Recovery for the Drift Coefficient of High-Dimensional Diffusions2014
The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel2014
The Approximate Sum Capacity of the Symmetric Gaussian <inline-formula> <tex-math notation="TeX">$K$ </tex-math></inline-formula>-User Interference Channel2014
The Capacity Region of the Source-Type Model for Secret Key and Private Key Generation2014
The Complexity of Approximating a Bethe Equilibrium2014
The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing2014
The Finite State MAC With Cooperative Encoders and Delayed CSI2014
The Group Square-Root Lasso: Theoretical Properties and Fast Algorithms2014
The Optimal Hard Threshold for Singular Values is \(4/\sqrt {3}\)2014
The Porosity of Additive Noise Channels2014
The Streaming-DMT of Fading Channels2014
Three New Families of Zero-Difference Balanced Functions With Applications2014
Threshold Saturation for Spatially Coupled LDPC and LDGM Codes on BMS Channels2014
To Feed or Not to Feedback2014
Toward Coding for Maximum Errors in Interactive Communication2014
Toward Photon-Efficient Key Distribution Over Optical Channels2014
Unitary Precoding and Basis Dependency of MMSE Performance for Gaussian Erasure Channels2014
Variable-Length Limited Feedback Beamforming in Multiple-Antenna Fading Channels2014
Variable Length Lossy Coding Using an LDPC Code2014
Vector Gaussian Multiterminal Source Coding2014
Which Boolean Functions Maximize Mutual Information on Noisy Inputs?2014
Wireless Network Simplification: The Gaussian <inline-formula> <tex-math notation="TeX">\(N\) </tex-math></inline-formula>-Relay Diamond Network2014
Wireless Network Simplification: The Gaussian \(N\) -Relay Diamond Network2014
Zero-Delay Sequential Transmission of Markov Sources Over Burst Erasure Channels2014
Accurate Prediction of Phase Transitions in Compressed Sensing via a Connection to Minimax Denoising2013
Achievable Error Exponents in the Gaussian Channel With Rate-Limited Feedback2013
Achievable Rates for Channels With Deletions and Insertions2013
Achievable Secrecy Rate Regions for the Two-Way Wiretap Channel2013
A Dirty Model for Multiple Sparse Regression2013
A Fourier-Analytic Approach to Reed-Muller Decoding2013
An Achievable Rate Region for the Broadcast Channel With Feedback2013
Analysis of the Impact of Nonlinearity on the Capacity of Communication Channels2013
An Asymptotically Optimal Push-Pull Method for Multicasting Over a Random Network2013
A Network Coding Approach to Loss Tomography2013
A New Construction of Zero-Difference Balanced Functions and Its Applications2013
An Improvement on the Gilbert–Varshamov Bound for Permutation Codes2013
Approximately Achieving Gaussian Relay Network Capacity With Lattice-Based QMF Codes2013
Approximate Sparsity Pattern Recovery: Information-Theoretic Lower Bounds2013
Approximate Sum-Capacity of the Y-Channel2013
A Smooth Entropy Approach to Quantum Hypothesis Testing and the Classical Capacity of Quantum Channels2013
A Spectral Graph Uncertainty Principle2013
Asymptotic Analysis of Complex LASSO via Complex Approximate Message Passing (CAMP)2013
Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage2013
Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks2013
Asynchronous Capacity per Unit Cost2013
Asynchronous Communication: Capacity Bounds and Suboptimality of Training2013
Asynchronous Communication: Exact Synchronization, Universality, and Dispersion2013

« prev Page 45/80 next »