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
Secrecy Capacity Region of Some Classes of Wiretap Broadcast Channels2015
Secret Communication Over Broadcast Erasure Channels With State-Feedback2015
Secure Network Coding With Erasures and Feedback2015
Separation of Source-Network Coding and Channel Coding in Wireline Networks2015
Signal Reconstruction From the Magnitude of Subspace Components2015
Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices2015
Sketching Sparse Matrices, Covariances, and Graphs via Tensor Products2015
Sparse and Spurious: Dictionary Learning With Noise and Outliers2015
Sparse Recovery With Graph Constraints2015
Stable Embedding of Grassmann Manifold via Gaussian Random Matrices2015
State-Dependent Parallel Gaussian Networks With a Common State-Cognitive Helper2015
Storage Capacity of Repairable Networks2015
Streaming Codes for Multicast Over Burst Erasure Channels2015
The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes2015
The Non-Regular CEO Problem2015
The Second-Order Coding Rate of the MIMO Quasi-Static Rayleigh Fading Channel2015
The Sender-Excited Secret Key Agreement Model: Capacity, Reliability, and Secrecy Exponents2015
The Third-Order Term in the Normal Approximation for the AWGN Channel2015
Tight Bound on Relative Entropy by Entropy Difference2015
Time Invariant Error Bounds for Modified-CS-Based Sparse Signal Sequence Recovery2015
Toward k-Connectivity of the Random Graph Induced by a Pairwise Key Predistribution Scheme With Unreliable Links2015
Traffic-Aware Training and Scheduling for MISO Wireless Downlink Systems2015
Two-Hop Interference Channels: Impact of Linear Schemes2015
Unequal Message Protection: Asymptotic and Non-Asymptotic Tradeoffs2015
Variable-Length Compression Allowing Errors2015
Weighted ℓ1-Minimization for Generalized Non-Uniform Sparse Model2015
When Are Dynamic Relaying Strategies Necessary in Half-Duplex Wireless Networks?2015
When Can Dictionary Learning Uniquely Recover Sparse Data From Subsamples?2015
A Bregman Matrix and the Gradient of Mutual Information for Vector Poisson and Gaussian Channels2014
A Broadcast Approach for Fading Wiretap Channels2014
Achievability Proof via Output Statistics of Random Binning2014
Achievable Rates of MIMO Systems With Linear Precoding and Iterative LMMSE Detection2014
Achieving the Capacity of the $N$ -Relay Gaussian Diamond Network Within log $N$ Bits2014
Achieving the Capacity of the <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula>-Relay Gaussian Diamond Network Within log <inline-formula> <2014
A Geometric Perspective to Multiple-Unicast Network Coding2014
A Graph Minor Perspective to Multicast Network Coding2014
A Lower Bound on the Sum Rate of Multiple Description Coding With Symmetric Distortion Constraints2014
An Axiomatic Approach to Constructing Distances for Rank Comparison and Aggregation2014
A New Construction of Frequency-Hopping Sequences With Optimal Partial Hamming Correlation2014
A New Entropy Power Inequality for Integer-Valued Random Variables2014
An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes2014
A Polymatroid Flow Model for Network Coded Multicast in Wireless Networks2014
Approximate Ergodic Capacity of a Class of Fading Two-User Two-Hop Networks2014
Approximate Message Passing With Consistent Parameter Estimation and Applications to Sparse Learning2014
A Refined Analysis of the Poisson Channel in the High-Photon-Efficiency Regime2014
Asymptotically Efficient Distributed Estimation With Exponential Family Statistics2014
A Unified Formulation of Gaussian Versus Sparse Stochastic Processes - Part I: Continuous-Domain Theory2014
A Unified Formulation of Gaussian Versus Sparse Stochastic Processes - Part II: Discrete-Domain Theory2014
A Universal Grammar-Based Code for Lossless Compression of Binary Trees2014
Bayesian Quickest Change-Point Detection With Sampling Right Constraints2014

« prev Page 41/80 next »