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
L1 Estimation: On the Optimality of Linear Estimators2024
Large and Small Deviations for Statistical Sequence Matching2024
Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes2024
Learning Transition Operators From Sparse Space-Time Samples2024
Leave-One-Out Approach for Matrix Completion: Primal and Dual Analysis2024
Likelihood-Free Hypothesis Testing2024
Limit Distribution Theory for f-Divergences2024
Lipschitz Bandits With Batched Feedback2024
Localization From Structured Distance Matrices via Low-Rank Matrix Recovery2024
Local Minima Structures in Gaussian Mixture Models2024
Logarithmically Larger Deletion Codes of All Distances2024
Low-Depth Flagged Syndrome Extraction for Calderbank-Shor-Steane Codes of Distance 32024
Matrices With Gaussian Noise: Optimal Estimates for Singular Subspace Perturbation2024
Matrix Inference in Growing Rank Regimes2024
Matrix Reordering for Noisy Disordered Matrices: Optimality and Computationally Efficient Algorithms2024
Maxflow-Based Bounds for Low-Rate Information Propagation Over Noisy Networks2024
Measuring Information From Moments2024
Message Transmission and Common Randomness Generation Over MIMO Slow Fading Channels With Arbitrary Channel State Distribution2024
Minimax Optimal Rates With Heavily Imbalanced Binary Data2024
Minimax Signal Detection in Sparse Additive Models2024
Mismatched Rate-Distortion Theory: Ensembles, Bounds, and General Alphabets2024
Model Selection for Generic Contextual Bandits2024
Multiple Packing: Lower Bounds via Error Exponents2024
Mutual Information Upper Bounds for Uniform Inputs Through the Deletion Channel2024
New Constructions of MDS Array Codes and Optimal Locally Repairable Array Codes2024
New Proofs of Gaussian Extremal Inequalities With Applications2024
New Quantum Algorithms for Computing Quantum Entropies and Distances2024
Noisy Sorting Capacity2024
Non-Binary Codes for Correcting a Burst of at Most t Deletions2024
Nonparametric Two-Sample Testing by Betting2024
Normalized Delivery Time of Wireless MapReduce2024
On Rank Energy Statistics via Optimal Transport: Continuity, Convergence, and Change Point Detection2024
On the Feasible Region of Efficient Algorithms for Attributed Graph Alignment2024
On the Fundamental Limits of Matrix Completion: Leveraging Hierarchical Similarity Graphs2024
On the Generalization for Transfer Learning: An Information-Theoretic Analysis2024
On the Information Theoretic Secure Aggregation With Uncoded Groupwise Keys2024
On the Squares of LCD Cyclic Codes and Their Complements: Study of Several Families and Analyzing Their Parameters2024
Optimal 1-bit Error Exponent for 2-Hop Relaying With Binary-Input Channels2024
Optimal Best Arm Identification With Fixed Confidence in Restless Bandits2024
Optimal Rates for Agnostic Distributed Learning2024
Optimal Rates for Nonparametric Density Estimation Under Communication Constraints2024
Optimal Second-Order Rates for Quantum Soft Covering and Privacy Amplification2024
Optimal Trace Distance and Fidelity Estimations for Pure Quantum States2024
Order Optimal Bounds for One-Shot Federated Learning Over Non-Convex Loss Functions2024
Permutation Capacity Region of Adder Multiple-Access Channels2024
Privacy-Preserving Collaborative Learning With Linear Communication Complexity2024
Provably Efficient Offline Reinforcement Learning With Trajectory-Wise Reward2024
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems2024
Quantizing Heavy-Tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recovery2024
Quantum Pufferfish Privacy: A Flexible Privacy Framework for Quantum Systems2024

« prev Page 8/80 next »