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
Unsourced Multiple Access With Random User Activity2023
WildWood: A New Random Forest Algorithm2023
Window-Limited CUSUM for Sequential Change Detection2023
Zero-Error Communication Over Adversarial MACs2023
A Construction of Maximally Recoverable Codes With Order-Optimal Field Size2022
Active Sampling for the Quickest Detection of Markov Networks2022
Adaptive and Oblivious Randomized Subspace Methods for High-Dimensional Optimization: Sharp Analysis and Lower Bounds2022
Adaptive Private Distributed Matrix Multiplication2022
Addendum and Erratum to "The MDS Queue: Analysing the Latency Performance of Erasure Codes"2022
Age of Information in Random Access Channels2022
A Graph Symmetrization Bound on Channel Information Leakage Under Blowfish Privacy2022
A Gröbner-Bases Approach to Syndrome-Based Fast Chase Decoding of Reed-Solomon Codes2022
Analysis of KNN Density Estimation2022
An Efficient Framework for Clustered Federated Learning2022
An Explicit Rate-Optimal Streaming Code for Channels With Burst and Arbitrary Erasures2022
An Information-Theoretic View of Stochastic Localization2022
A Revisitation of Low-Rate Bounds on the Reliability Function of Discrete Memoryless Channels for List Decoding2022
A Second-Order Converse Bound for the Multiple-Access Channel via Wringing Dependence2022
Asymptotics of Sequential Composite Hypothesis Testing Under Probabilistic Constraints2022
A Tunable Loss Function for Robust Classification: Calibration, Landscape, and Generalization2022
A Unified Discretization Approach to Compute–Forward: From Discrete to Continuous Inputs2022
Batch Optimization for DNA Synthesis2022
Bayesian Risk With Bregman Loss: A Cramér-Rao Type Bound and Linear Estimation2022
Bias for the Trace of the Resolvent and Its Application on Non-Gaussian and Non-Centered MIMO Channels2022
Biharmonic Distance-Based Performance Metric for Second-Order Noisy Consensus Networks2022
Binary Locally Repairable Codes With Large Availability and its Application to Private Information Retrieval2022
Bounds on the Zero-Error List-Decoding Capacity of the q/(q - 1) Channel2022
Bridging Offline Reinforcement Learning and Imitation Learning: A Tale of Pessimism2022
Broadcasting on Two-Dimensional Regular Grids2022
Classification Logit Two-Sample Testing by Neural Networks for Differentiating Near Manifold Densities2022
Clustering-Correcting Codes2022
Coded Distributed Computing With Partial Recovery2022
Coded Sparse Matrix Computation Schemes That Leverage Partial Stragglers2022
Combination Networks With End-User-Caches: Novel Achievable and Converse Bounds Under Uncoded Cache Placement2022
Communication Efficient Secret Sharing With Small Share Size2022
Compressed Sensing in the Presence of Speckle Noise2022
Compressed Sensing With Upscaled Vector Approximate Message Passing2022
Computational Polarization: An Information-Theoretic Method for Resilient Computing2022
Constructions of Optimal Uniform Wide-Gap Frequency-Hopping Sequences2022
Convex Formulation of Overparameterized Deep Neural Networks2022
Corrections to "Optimal Streaming Erasure Codes Over the Three-Node Relay Network"2022
Corrections to "Provable Low Rank Phase Retrieval"2022
Cox Point Process Regression2022
CRC-Aided List Decoding of Convolutional Codes in the Short Blocklength Regime2022
Data Deduplication With Random Substitutions2022
Deterministic and Probabilistic Conditions for Finite Completability of Low-Tucker-Rank Tensor2022
Deterministic Identification Over Channels With Power Constraints2022
Differentially Quantized Gradient Methods2022
Disordered Complex Networks: Energy Optimal Lattices and Persistent Homology2022
Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration and Lower Bounds2022

« prev Page 13/80 next »