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
Asymmetric Lee Distance Codes for DNA-Based Storage2017
Asymptotics and Non-Asymptotics for Universal Fixed-to-Variable Source Coding2017
A Tight Upper Bound on the Second-Order Coding Rate of the Parallel Gaussian Channel With Feedback2017
A Truncated Prediction Framework for Streaming Over Erasure Channels2017
A Two Channel System Approximation for Bandlimited Functions2017
Bayesian Group Testing Under Sum Observations: A Parallelizable Two-Approximation for Entropy Loss2017
Binary Fading Interference Channel With No CSIT2017
Blind Deconvolution Meets Blind Demixing: Algorithms and Performance Bounds2017
Blind Index Coding2017
Bounds on Variance for Unimodal Distributions2017
Broadcast Channels With Privacy Leakage Constraints2017
Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding2017
Capacity Analysis of Discrete Energy Harvesting Channels2017
Capacity and Expressiveness of Genomic Tandem Duplication2017
Capacity Bounds for Additive Symmetric α-Stable Noise Channels2017
Capacity of Remotely Powered Communication2017
Capacity of Systems with Queue-Length Dependent Service Quality2017
Capacity Results for the Multicast Cognitive Interference Channel2017
Channel Detection in Coded Communication2017
Coded Caching With Nonuniform Demands2017
Codes Correcting a Burst of Deletions or Insertions2017
Coding for Interactive Communication Correcting Insertions and Deletions2017
Comments on the Proof of Adaptive Stochastic Set Cover Based on Adaptive Submodularity and Its Implications for the Group Identification Problem in "Group-Based Active Query Selection for Rapid Diagno2017
Communication With Imperfectly Shared Randomness2017
Complete Dictionary Recovery Over the Sphere II: Recovery by Riemannian Trust-Region Method2017
Complete Dictionary Recovery Over the Sphere I: Overview and the Geometric Picture2017
Compressed Sensing and Parallel Acquisition2017
Compressed Sensing With Prior Information: Strategies, Geometry, and Bounds2017
Compression-Based Compressed Sensing2017
Compressive Sampling Using Annihilating Filter-Based Low-Rank Interpolation2017
Computing Linear Transformations With Unreliable Components2017
Consistent Estimation of the Filtering and Marginal Smoothing Distributions in Nonparametric Hidden Markov Models2017
Construction of Sequences With High Nonlinear Complexity From Function Fields2017
Constructions of Optimal and Near-Optimal Multiply Constant-Weight Codes2017
Density Evolution for Deterministic Generalized Product Codes on the Binary Erasure Channel at High Rates2017
Detecting a Suddenly Arriving Dynamic Profile of Finite Duration2017
Directed Information Between Connected Leaky Integrate-and-Fire Neurons2017
Discrete Lossy Gray-Wyner Revisited: Second-Order Asymptotics, Large and Moderate Deviations2017
Distributed Binary Detection With Lossy Data Compression2017
Distributed Multicast Tree Construction in Wireless Sensor Networks2017
Distributed Simulation of Continuous Random Variables2017
Does $\ell _{p}$ -Minimization Outperform $\ell _{1}$ -Minimization?2017
Does ℓp-Minimization Outperform ℓ1-Minimization?2017
Duplication-Correcting Codes for Data Storage in the DNA of Living Organisms2017
Duplication Distance to the Root for Binary Sequences2017
Dynamic Spectrum Management: A Complete Complexity Characterization2017
Efficient Regression in Metric Spaces via Approximate Lipschitz Extension.2017
Energy-Distortion Exponents in Lossy Transmission of Gaussian Sources Over Gaussian Channels2017
Equivalence for Networks With Adversarial State2017
Equivocations, Exponents, and Second-Order Coding Rates Under Various Rényi Information Measures2017

« prev Page 31/80 next »