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
Optimal Construction of N-Bit-Delay Almost Instantaneous Fixed-to-Variable-Length Codes2025
Optimal Estimation of the Null Distribution in Large-Scale Inference2025
Optimal Few-SSW Linear Codes and Their Subcode Support Weight Distributions2025
Optimal Trace Codes and Their Self-Orthogonality2025
Optimal Wire Cutting With Classical Communication2025
Overparameterized ReLU Neural Networks Learn the Simplest Model: Neural Isometry and Phase Transitions2025
Pearson Chi-Squared Conditional Randomization Test2025
Performance Analysis of Joint Antenna Selection and Precoding Methods in Multi-User Massive MISO2025
Permutation and Multi-Permutation Codes Correcting Multiple Deletions2025
Poset-Markov Channels: Capacity via Group Symmetry2025
Precise Regularized Minimax Regret With Unbounded Weights2025
Private Aggregation in Hierarchical Wireless Federated Learning With Partial and Full Collusion2025
Private Inference in Quantized Models2025
Properties of Algorithmic Information Distance2025
Proving Information Inequalities by Gaussian Elimination2025
Quantitative Group Testing and Pooled Data in the Linear Regime With Sublinear Tests2025
Quantum Advantage in Zero-Error Function Computation With Side Information2025
Quasi Complementary Sequence Sets: New Bounds and Optimal Constructions via Quasi-Florentine Rectangles2025
Rate-Distortion-Perception Theory for the Quadratic Wasserstein Space2025
Reducing Fragmentation in Data Deduplication Systems via Partial Repetition and Coding2025
Rejection-Sampled Universal Quantization for Smaller Quantization Errors2025
Repairing Schemes for Tamo-Barg Codes2025
Research on the Construction of Maximum Distance Separable Codes via Arbitrary Twisted Generalized Reed-Solomon Codes2025
Resolvability of Classical-Quantum Channels2025
Rethinking Hard Thresholding Pursuit: Full Adaptation and Sharp Estimation2025
Risk-Sensitive Reinforcement Learning With ϕ-Divergence-Risk2025
Robust Distributed Clustering With Redundant Data Assignment2025
Robust Offline Reinforcement Learning for Non-Markovian Decision Processes2025
Robust Score-Based Quickest Change Detection2025
Sample-Efficient Reinforcement Learning From Human Feedback via Information-Directed Sampling2025
Schrödinger-Föllmer Sampler2025
Semantic Security With Infinite-Dimensional Quantum Eavesdropping Channel2025
Semi-Supervised Deep Sobolev Regression: Estimation and Variable Selection by ReQU Neural Network2025
Sharp Convergence Rates for Matching Pursuit2025
Shifted Composition I: Harnack and Reverse Transport Inequalities2025
Sibson α-Mutual Information and Its Variational Representations2025
Simple Binary Hypothesis Testing Under Local Differential Privacy and Communication Constraints2025
Simultaneous Computation and Communication Over MAC2025
Space Complexity of Euclidean Clustering2025
Speeding Up Distributed Learning via Sparse and Flexible Coded Computing2025
Subspace and DOA Estimation Under Coarse Quantization2025
Support Recovery in Mixture Models With Sparse Parameters2025
The b-Symbol Hamming Weight Spectra of Quaternary Kerdock Codes and Related Codes2025
The Convex Landscape of Neural Networks: Characterizing Global Optima and Stationary Points via Lasso Models2025
The Generating Idempotent Is a Minimum-Weight Codeword for Some Binary BCH Codes2025
The Multiple-Access Channel With Entangled Transmitters2025
The Mutual Information in the Vicinity of Capacity-Achieving Input Distributions2025
Theoretical Analysis of Robust Overfitting for Wide DNNs: An NTK Approach2025
Theoretical Guarantees for Sparse Principal Component Analysis Based on the Elastic Net2025
Theoretical Study of Conflict-Avoidant Multi-Objective Reinforcement Learning2025

« prev Page 5/80 next »