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
Distribution of the Scaled Condition Number of Single-Spiked Complex Wishart Matrices2022
Duality Between Source Coding With Quantum Side Information and Classical-Quantum Channel Coding2022
Encoder Blind Combinatorial Compressed Sensing2022
Endurance-Limited Memories: Capacity and Codes2022
Entropic Compressibility of Lévy Processes2022
Entrywise Estimation of Singular Vectors of Low-Rank Matrices With Heteroskedasticity and Dependence2022
Error-Correcting Codes for Short Tandem Duplication and Edit Errors2022
Error Probability Bounds for Coded-Index DNA Storage Systems2022
Exponential Savings in Agnostic Active Learning Through Abstention2022
Faithful Simulation of Distributed Quantum Measurements With Applications in Distributed Rate-Distortion Theory2022
Finite-Bit Quantization for Distributed Algorithms With Linear Convergence2022
Fundamental Limits of Deep Graph Convolutional Networks for Graph Classification2022
Fundamental Structure of Optimal Cache Placement for Coded Caching With Nonuniform Demands2022
Generalization Bounds and Algorithms for Learning to Communicate Over Additive Noise Channels2022
Generalized Maximum Entropy for Supervised Classification2022
Generalized Pair Weights of Linear Codes and Linear Isomorphisms Preserving Pair Weights2022
Generalized Submodular Information Measures: Theoretical Properties, Examples, Optimization Algorithms, and Applications2022
Improved Maximally Recoverable LRCs Using Skew Polynomials2022
Individually Conditional Individual Mutual Information Bound on Generalization Error2022
Infinite Divisibility of Information2022
Interactive Inference Under Information Constraints2022
Interference Alignment for the K-User MIMO Interference Channel2022
Q-Ary Non-Overlapping Codes: A Generating Function Approach2022
Joint Constellation Design for Noncoherent MIMO Multiple-Access Channels2022
Learning Convex Polyhedra With Margin2022
Learning Quantum Circuits of Some T Gates2022
Linear Phaseless Retrieval of Functions in Spline Spaces With Arbitrary Knots2022
List Decoding Random Euclidean Codes and Infinite Constellations2022
Lower Bound on the Capacity of the Continuous-Space SSFM Model of Optical Fiber2022
Lower Bounds for Maximally Recoverable Tensor Codes and Higher Order MDS Codes2022
Lower Bounds on the Generalization Error of Nonlinear Learning Models2022
Macroscopic Analysis of Vector Approximate Message Passing in a Model-Mismatched Setting2022
Max-Affine Regression: Parameter Estimation for Gaussian Designs2022
Mean Estimation From One-Bit Measurements2022
Memory-Rate Tradeoff for Caching With Uncoded Placement Under Nonuniform Random Demands2022
Minimax Off-Policy Evaluation for Multi-Armed Bandits2022
Minimum Excess Risk in Bayesian Learning2022
Mismatched Decoding Reliability Function at Zero Rate2022
Multiple Criss-Cross Insertion and Deletion Correcting Codes2022
Multi-Server Weakly-Private Information Retrieval2022
NBIHT: An Efficient Algorithm for 1-Bit Compressed Sensing With Optimal Error Decay Rate2022
Nearest Neighbor Density Functional Estimation From Inverse Laplace Transform2022
Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms2022
New Constructions of Complementary Sequence Pairs Over 4q-QAM2022
Noisy Adaptive Group Testing via Noisy Binary Search2022
Non-Parametric Quickest Mean-Change Detection2022
On Non-Detectability of Non-Computability and the Degree of Non-Computability of Solutions of Circuit and Wave Equations on Digital Computers2022
On Smooth Rényi Entropies: A Novel Information Measure, One-Shot Coding Theorems, and Asymptotic Expansions2022
On the Best Choice of Lasso Program Given Data Parameters2022
On the Generalized Covering Radii of Reed-Muller Codes2022

« prev Page 14/80 next »