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 Linearity of Bayesian Interpolators for Non-Gaussian Continuous-Time AR(1) Processes2013
On Theorem 10 in "On Polar Polytopes and the Recovery of Sparse Representations" [Sep 07 3188-3195]2013
On the Performance Limits of Map-Aware Localization2013
On the Rate Region of CSMA/CA WLANs2013
On the Robustness of Lattice Interference Alignment2013
On the Role of Mobility for Multimessage Gossip2013
On the Symmetric Feedback Capacity of the $K$-User Cyclic Z-Interference Channel2013
On the Synergistic Benefits of Alternating CSIT for the MISO Broadcast Channel2013
Opportunistic Detection Under a Fixed-Sample-Size Setting2013
Optimal Coding for the Binary Deletion Channel With Small Deletion Probability2013
Optimal Encoding for Discrete Degraded Broadcast Channels2013
Optimal Frequency Hopping Sequences of Odd Length2013
Outage Exponent: A Unified Performance Metric for Parallel Fading Channels2013
Outlier-Robust PCA: The High-Dimensional Case2013
Performance Analysis of Likelihood-Based Multiple Access for Detection Over Fading Channels2013
Performance Guarantees for Adaptive Estimation of Sparse Signals.2013
Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model2013
Performance of Mutual Information Inference Methods Under Unknown Interference2013
Period Distribution of the Generalized Discrete Arnold Cat Map for $N = 2^{e}$2013
Polar Codes for the Two-User Multiple-Access Channel2013
Polar Coding Without Alphabet Extension for Asymmetric Models2013
Proactive Resource Allocation: Harnessing the Diversity and Multicast Gains2013
Probabilistic Recovery Guarantees for Sparsely Corrupted Signals2013
Proof of the Outage Probability Conjecture for MISO Channels2013
Quick Search for Rare Events2013
Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization2013
Real-Time Coding With Limited Lookahead2013
Real-Time Peer-to-Peer Streaming Over Multiple Random Hamiltonian Cycles2013
Recovery of Low-Rank Plus Compressed Sparse Matrices With Application to Unveiling Traffic Anomalies2013
Reduced-Dimension Multiuser Detection2013
Refined Support and Entropic Uncertainty Inequalities2013
Reliable Joint Source-Channel Cooperative Transmission Over Relay Networks2013
Repair Optimal Erasure Codes Through Hadamard Designs2013
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors2013
Robust Estimation of Latent Tree Graphical Models: Inferring Hidden States With Inexact Parameters2013
Robust Lasso With Missing and Grossly Corrupted Observations2013
Robustness of Sparse Recovery via $F$-minimization: A Topological Viewpoint2013
Robust Sparse Analysis Regularization2013
Saddle Point in the Minimax Converse for Channel Coding2013
Secrecy Degrees of Freedom of MIMO Broadcast Channels With Delayed CSIT2013
Secrecy Outage Capacity of Fading Channels2013
Secure Multiterminal Source Coding With Side Information at the Eavesdropper2013
Secure Source Coding With a Helper2013
Sequential Detection of Multiple Change Points in Networks: A Graphical Model Approach2013
Shannon Meets Nyquist: Capacity of Sampled Gaussian Channels2013
Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries2013
Source-Channel Coding Theorems for the Multiple-Access Relay Channel2013
Source Coding When the Side Information May Be Delayed2013
Spectral Distribution of Product of Pseudorandom Matrices Formed From Binary Block Codes2013
Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm2013

« prev Page 48/80 next »