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
Refined Asymptotics for Rate-Distortion Using Gaussian Codebooks for Arbitrary Sources2019
Rényi Resolvability and Its Applications to the Wiretap Channel2019
Repairing Multiple Failures for Scalar MDS Codes2019
Sample-Efficient Algorithms for Recovering Structured Signals From Magnitude-Only Measurements2019
Secrecy Capacity of Colored Gaussian Noise Channels With Feedback2019
Secure and Robust Identification via Classical-Quantum Channels2019
Secure Clustered Distributed Storage Against Eavesdropping2019
Semidefinite Programming Converse Bounds for Quantum Communication2019
Sensor Array Design Through Submodular Optimization2019
Sharp Bounds for Mutual Covering2019
"Short-Dot": Computing Large Linear Transforms Distributedly Using Coded Short Dot Products2019
Simulation of Random Variables Under Rényi Divergence Measures of All Orders2019
Snapshot Compressed Sensing: Performance Bounds and Algorithms2019
SOFAR: Large-Scale Association Network Learning2019
Sparse and Balanced Reed-Solomon and Tamo-Barg Codes2019
State-Dependent Interference Channel With Correlated States2019
Statistical Mechanics of MAP Estimation: General Replica Ansatz2019
Storage Capacity as an Information-Theoretic Vertex Cover and the Index Coding Rate2019
Strong Converses are Just Edge Removal Properties2019
Structured Signal Recovery From Quadratic Measurements: Breaking Sample Complexity Barriers via Nonconvex Optimization2019
Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes2019
Sum-Rate Capacity for Symmetric Gaussian Multiple Access Channels With Feedback2019
Symmetry, Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization2019
Testing Ising Models2019
"The Capacity of the Relay Channel": Solution to Cover's Problem in the Gaussian Case2019
The Dispersion of Mismatched Joint Source-Channel Coding for Arbitrary Sources and Additive Channels2019
The Distortion-Rate Function of Sampled Wiener Processes2019
The Entropy Rate of Some Pólya String Models2019
The Error Probability of Sparse Superposition Codes With Approximate Message Passing Decoding2019
The Informativeness of k-Means for Learning Mixture Models2019
Theoretical Insights Into the Optimization Landscape of Over-Parameterized Shallow Neural Networks2019
The Price of Uncertain Priors in Source Coding2019
The Reliability Function of Variable-Length Lossy Joint Source-Channel Coding With Feedback2019
The Replica-Symmetric Prediction for Random Linear Estimation With Gaussian Matrices Is Exact2019
The Simultaneous Connectivity of Cognitive Networks2019
The Wiretap Channel With Generalized Feedback: Secure Communication and Key Generation2019
Three Families of Monomial Functions With Three-Valued Walsh Spectrum2019
Tone Reservation for OFDM With Restricted Carrier Set2019
Tunable Measures for Information Leakage and Applications to Privacy-Utility Tradeoffs2019
Unique Reconstruction of Coded Strings From Multiset Substring Spectra2019
Universal Sparse Superposition Codes With Spatial Coupling and GAMP Decoding2019
Vector Approximate Message Passing2019
Vector Approximate Message Passing.2019
Wiretap and Gelfand-Pinsker Channels Analogy and Its Applications2019
Wiretap Channels: Nonasymptotic Fundamental Limits2019
Achievable Moderate Deviations Asymptotics for Streaming Compression of Correlated Sources2018
A Communication Channel With Random Battery Recharges2018
A Fundamental Limitation on Maximum Parameter Dimension for Accurate Estimation With Quantized Data2018
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing2018
A Gaussian Process Regression Model for Distribution Inputs2018

« prev Page 26/80 next »