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
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers2008
Constrained Sequential Resource Allocation and Guessing Games2008
Correction to "The Importance of Convexity in Learning With Squared Loss"2008
Data Fusion Trees for Detection: Does Architecture Matter?2008
Digital Communications Over Fading Channels (M.K. Simon and M.S. Alouini; 2005) [Book Review]2008
Discrete-Input Two-Dimensional Gaussian Channels With Memory: Estimation and Information Rates Via Graphical Models and Statistical Mechanics2008
Distributed Estimation Via Random Access2008
Distributed Power Allocation With Rate Constraints in Gaussian Parallel Interference Channels2008
Distributed Source Coding in the Presence of Byzantine Sensors2008
Entanglement-Assisted Capacity of Quantum Multiple-Access Channels2008
Ergodic Classical-Quantum Channels: Structure and Coding Theorems2008
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy.2008
Extremal Problems of Information Combining2008
Fast Distributed Algorithms for Computing Separable Functions2008
Fast Solution of l1-Norm Minimization Problems When the Solution May Be Sparse2008
Gaussian Interference Channel Capacity to Within One Bit2008
Graph-Based Semi-Supervised Learning and Spectral Kernel Design2008
Group Divisible Codes and Their Application in the Construction of Optimal Constant-Composition Codes of Weight Three2008
How to Filter an "Individual Sequence With Feedback"2008
Improved Lower Bounds for Constant GC-Content DNA Codes2008
Improved Risk Tail Bounds for On-Line Algorithms2008
Information Consistency of Nonparametric Gaussian Process Methods2008
Joint Design and Separation Principle for Opportunistic Spectrum Access in the Presence of Sensing Errors.2008
Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-Alphabet Memoryless Sources2008
Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-AlphabetMemoryless Sources2008
Joint Source and Channel Coding for MIMO Systems: Is it Better to be Robust or Quick?2008
Joint Source-Channel Codes for MIMO Block-Fading Channels2008
Lautum Information2008
Max-Product for Maximum Weight Matching: Convergence, Correctness, and LP Duality2008
Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding2008
Minimax Bounds for Active Learning2008
Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes2008
More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding2008
Multiple-Access Channels With Confidential Messages2008
Multiuser Successive Refinement and Multiple Description Coding2008
Myopic Coding in Multiterminal Networks2008
Network Inference From Co-Occurrences2008
Node-Based Optimal Power Control, Routing, and Congestion Control in Wireless Networks2008
On Information Embedding When Watermarks and Covertexts are Correlated2008
On Multiterminal Source Code Design2008
On Optimal Quantization Rules for Some Problems in Sequential Decentralized Detection2008
On Secret Reconstruction in Secret Sharing Schemes2008
On the Calculation of the Hilbert Transform From Interpolated Data2008
On the Complexity of Hardness Amplification2008
On the Connection-Level Stability of Congestion-Controlled Communication Networks2008
On the Construction of (Explicit) Khodak's Code and Its Analysis2008
On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes2008
On the Delay and Throughput Gains of Coding in Unreliable Networks2008
On the Efficiency of Embedding Information Within Scalar Quantizers2008
On The Han-Kobayashi Region for theInterference Channel2008

« prev Page 62/80 next »