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
Secure Coded Multi-Party Computation for Massive Matrix Operations2021
Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs2021
Semisupervised Clustering by Queries and Locally Encodable Source Coding2021
Sequential Classification With Empirically Observed Statistics2021
Service Rate Region: A New Aspect of Coded Distributed System Design2021
Signaling Games for Log-Concave Distributions: Number of Bins and Properties of Equilibria2021
Single-Index Models in the High Signal Regime2021
Sketching Semidefinite Programs for Faster Clustering2021
Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling2021
Spectral Method for Phase Retrieval: An Expectation Propagation Perspective2021
Stabilizing a System With an Unbounded Random Gain Using Only Finitely Many Bits2021
State Masking Over a Two-State Compound Channel2021
Strong Converse Bounds in Quantum Network Information Theory2021
Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding2021
Tackling Small Eigen-Gaps: Fine-Grained Eigenvector Estimation and Inference Under Heteroscedastic Noise2021
Teaching and Learning in Uncertainty2021
The Average-Case Time Complexity of Certifying the Restricted Isometry Property2021
The Capacity of Associated Subsequence Retrieval2021
The CEO Problem With Inter-Block Memory2021
The CEO Problem With rth Power of Difference and Logarithmic Distortions2021
The CEO Problem With rth Power of Difference and Logarithmic Distortions2021
The Global Optimization Geometry of Low-Rank Matrix Optimization2021
The Gray-Wyner Network and Wyner’s Common Information for Gaussian Sources2021
The Quantum Wasserstein Distance of Order 12021
The Rate-Distortion Risk in Estimation From Compressed Data2021
The Secrecy Capacity of Cost-Constrained Wiretap Channels2021
The Spiked Matrix Model With Generative Priors2021
Third-Order Asymptotics of Variable-Length Compression Allowing Errors2021
Torn-Paper Coding2021
To Split or not to Split: The Impact of Disparate Treatment in Classification2021
Trace Reconstruction: Generalized and Parameterized2021
Trace Reconstruction Problems in Computational Biology2021
Two-Stage Estimation for Quantum Detector Tomography: Error Analysis, Numerical and Experimental Results2021
Uncertainty in Identification Systems2021
Understanding Estimation and Generalization Error of Generative Adversarial Networks2021
Uplink-Downlink Duality Between Multiple-Access and Broadcast Channels With Compressing Relays2021
Upper Bounds on the Generalization Error of Private Algorithms for Discrete Data2021
Vector Gaussian Successive Refinement With Degraded Side Information2021
Weighted Matrix Completion From Non-Random, Non-Uniform Sampling Patterns2021
What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?2021
Zero-Delay Lossy Coding of Linear Vector Markov Sources: Optimality of Stationary Codes and Near Optimality of Finite Memory Codes2021
Age-Minimal Transmission for Energy Harvesting Sensors With Finite Batteries: Online Policies2020
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding2020
An Algebraic-Geometric Approach for Linear Regression Without Correspondences2020
Analysis of KNN Information Estimators for Smooth Distributions2020
Analysis of Spectral Methods for Phase Retrieval With Random Orthogonal Matrices2020
Analysis on Boolean Function in a Restricted (Biased) Domain2020
A New Lower Bound on the Maximum Correlation of a Set With Mismatched Filters2020
An Index Coding Approach to Caching With Uncoded Cache Placement2020
A Note on the Probability of Rectangles for Correlated Binary Strings2020

« prev Page 19/80 next »