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
On Generalization Bounds for Deep Networks Based on Loss Surface Implicit Regularization2023
On L2-Consistency of Nearest Neighbor Matching2023
On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals2023
On the Differential Spectrum and the APcN Property of a Class of Power Functions Over Finite Fields2023
On the Separation of Correlation-Assisted Sum Capacities of Multiple Access Channels2023
Optimal Aggregation Strategies for Social Learning Over Graphs2023
Optimal Convex Lifted Sparse Phase Retrieval and PCA With an Atomic Matrix Norm Regularizer2023
Optimal Prediction of Markov Chains With and Without Spectral Gap2023
Optimal Randomized Approximations for Matrix-Based Rényi's Entropy2023
Parameters of Squares of Primitive Narrow-Sense BCH Codes and Their Complements2023
Partial Information Sharing Over Social Learning Networks2023
Performance Bounds for Group Testing With Doubly-Regular Designs2023
PMDS Array Codes With Small Sub-Packetization, Small Repair Bandwidth/Rebuilding Access2023
Privacy of Synthetic Data: A Statistical Framework2023
Provable Identifiability of Two-Layer ReLU Neural Networks via LASSO Regularization2023
Provable Tradeoffs in Adversarially Robust Classification2023
Provably Private Distributed Averaging Consensus: An Information-Theoretic Approach2023
Proving Information Inequalities and Identities With Symbolic Computation2023
Pufferfish Privacy: An Information-Theoretic Study2023
Quantum Algorithm for Fidelity Estimation2023
Quasi-Cyclic Perfect Codes in Doob Graphs and Special Partitions of Galois Rings2023
Quickest Change Detection With Non-Stationary Post-Change Observations2023
Quickest Inference of Network Cascades With Noisy Information2023
Rate-Exponent Region for a Class of Distributed Hypothesis Testing Against Conditional Independence Problems2023
Recovery From Non-Decomposable Distance Oracles2023
Recovery of Future Data via Convolution Nuclear Norm Minimization2023
Regret Bounds for Log-Loss via Bayesian Algorithms2023
Resolution Limits of Non-Adaptive 20 Questions Search for a Moving Target2023
Revisiting Modular Inversion Hidden Number Problem and Its Applications2023
Robust Max Entrywise Error Bounds for Tensor Estimation From Sparse Observations via Similarity-Based Collaborative Filtering2023
Self-Aware Social Learning Over Graphs2023
Sensing RISs: Enabling Dimension-Independent CSI Acquisition for Beamforming2023
Simplex-Based Proximal Multicategory Support Vector Machine2023
Single-Deletion Single-Substitution Correcting Codes2023
Spectral CUSUM for Online Network Structure Change Detection2023
Storage Codes With Flexible Number of Nodes2023
Streaming Erasure Codes Over Multi-Access Relayed Networks2023
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding2023
Tensor Principal Component Analysis in High Dimensional CP Models2023
The Effect of Symmetry on the De-Anonymizability of Social Networks2023
The Efficacy of Pessimism in Asynchronous Q-Learning2023
The Noisy Drawing Channel: Reliable Data Storage in DNA Sequences2023
Tree Density Estimation2023
Two-Dimensional RC/SW Constrained Codes: Bounded Weight and Almost Balanced Weight2023
Two-Timescale Design for Reconfigurable Intelligent Surface-Aided Massive MIMO Systems With Imperfect CSI2023
Uncertainty Quantification for Nonconvex Tensor Completion: Confidence Intervals, Heteroscedasticity and Optimality2023
Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication2023
Uniform Exact Reconstruction of Sparse Signals and Low-Rank Matrices From Phase-Only Measurements2023
Unitarity Estimation for Quantum Channels2023
Universality Laws for High-Dimensional Learning With Random Features2023

« prev Page 12/80 next »