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
Minimax Rate Optimal Adaptive Nearest Neighbor Classification and Regression2021
Minimum Feedback for Collision-Free Scheduling in Massive Random Access2021
Modulated Sparse Superposition Codes for the Complex AWGN Channel2021
Multi-Armed Bandits With Correlated Arms2021
Multilayer Codes for Synchronization From Deletions and Insertions2021
Multi-Marginal Optimal Transport and Probabilistic Graphical Models2021
New Construction of Complementary Sequence (or Array) Sets and Complete Complementary Codes2021
New Construction of Optimal Type-II Binary Z-Complementary Pairs2021
New Constructions of Complementary Sequence Pairs Over 4 q -QAM2021
New LCD MDS Codes of Non-Reed-Solomon Type2021
New Results on Self-Dual Generalized Reed-Solomon Codes2021
New Risk Bounds for 2D Total Variation Denoising2021
Nonconvex Matrix Factorization From Rank-One Measurements2021
On Covert Communication Against Sequential Change-Point Detection2021
One-Shot Variable-Length Secret Key Agreement Approaching Mutual Information2021
On Hulls of Some Primitive BCH Codes and Self-Orthogonal Codes2021
On Non-Interactive Simulation of Binary Random Variables2021
On Optimal Locally Repairable Codes and Generalized Sector-Disk Codes2021
On Recovery of Sparse Signals With Prior Support Information via Weighted ℓₚ-Minimization2021
On Sparse Linear Regression in the Local Differential Privacy Model2021
On Statistical Efficiency in Learning2021
On the Capacity of Channels With Deletions and States2021
On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks2021
On the Minimum Node Degree and k-Connectivity in Inhomogeneous Random K-Out Graphs2021
On the Optimality of the Greedy Policy for Battery Limited Energy Harvesting Communications2021
On the Sample Complexity of HGR Maximal Correlation Functions for Large Datasets2021
Optimal Change-Point Detection With Training Sequences in the Large and Moderate Deviations Regimes2021
Optimal Communication Rates and Combinatorial Properties for Common Randomness Generation2021
Optimal Rates of Teaching and Learning Under Uncertainty2021
Optimal Sampling and Scheduling for Timely Status Updates in Multi-Source Networks2021
Optimum Multi-Stream Sequential Change-Point Detection With Sampling Control2021
Partial MDS Codes With Regeneration2021
Private Hypothesis Selection2021
Properties of the Support of the Capacity-Achieving Distribution of the Amplitude-Constrained Poisson Noise Channel2021
Pursuing the Fundamental Limits for Quantum Communication2021
Quantized Compressed Sensing by Rectified Linear Units2021
Quantum Channel State Masking2021
RATQ: A Universal Fixed-Length Quantizer for Stochastic Optimization2021
Reed-Muller Codes: Theory and Algorithms2021
Regret Bounds and Regimes of Optimality for User-User and Item-Item Collaborative Filtering2021
Relaxed Locally Correctable Codes in Computationally Bounded Channels2021
Repairing Reed-Solomon Codes via Subspace Polynomials2021
Resolution Limits for the Noisy Non-Adaptive 20 Questions Problem2021
Reversal of Rényi Entropy Inequalities Under Log-Concavity2021
Revisiting Randomized Gossip Algorithms: General Framework, Convergence Rates and Novel Block and Accelerated Protocols2021
Robust Scatter Matrix Estimation for High Dimensional Distributions With Heavy Tail2021
Sample-Efficient Low Rank Phase Retrieval2021
Sample-Measurement Tradeoff in Support Recovery Under a Subgaussian Prior2021
Secrecy by Design With Applications to Privacy and Compression2021
Secret Key Generation From Vector Gaussian Sources With Public and Private Communications2021

« prev Page 18/80 next »