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
Adaptive Group Testing on Networks With Community Structure: The Stochastic Block Model2023
Adaptive Relaying for Streaming Erasure Codes in a Three Node Relay Network2023
A Generalization of Array Codes With Local Properties and Efficient Encoding/Decoding2023
Age Optimal Sampling Under Unknown Delay Statistics2023
Algorithmic Computability and Approximability of Capacity-Achieving Input Distributions2023
Almost Optimal Variance-Constrained Best Arm Identification2023
An Asymptotically Optimal Two-Part Fixed-Rate Coding Scheme for Networked Control With Unbounded Noise2023
An Automated Theorem Proving Framework for Information-Theoretic Results2023
A New Cooperative Repair Scheme With k + 1 Helper Nodes for (n, k) Hadamard MSR Codes With Small Sub-Packetization2023
An Index Policy for Minimizing the Uncertainty-of-Information of Markov Sources2023
A Polynomial Time Algorithm for Constructing Optimal Binary AIFV-2 Codes2023
Approximation Speed of Quantized Versus Unquantized ReLU Neural Networks and Beyond2023
A Proof of a Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels2023
Arbitrarily Varying Wiretap Channels With Non-Causal Side Information at the Jammer2023
Asymptotic Errors for Teacher-Student Convex Generalized Linear Models (Or: How to Prove Kabashima's Replica Formula)2023
Asymptotic Mutual Information Analysis for Double-Scattering MIMO Channels: A New Approach by Gaussian Tools2023
Asymptotic Performance of Thompson Sampling for Batched Multi-Armed Bandits2023
Asynchronous Massive Access and Neighbor Discovery Using OFDMA2023
A Unified Framework for Correlation Mining in Ultra-High Dimension2023
A Worker-Task Specialization Model for Crowdsourcing: Efficient Inference and Fundamental Limits2023
Balancing Statistical and Computational Precision: A General Theory and Applications to Sparse Regression2023
Bayesian Inference With Nonlinear Generative Models: Comments on Secure Learning2023
Bayesian Two-Stage Sequential Change Diagnosis via Sensor Arrays2023
Benign Overfitting in Multiclass Classification: All Roads Lead to Interpolation2023
Best Arm Identification in Restless Markov Multi-Armed Bandits2023
Boundary Conditions for Linear Exit Time Gradient Trajectories Around Saddle Points: Analysis and Algorithm2023
Bounding the Forward Classical Capacity of Bipartite Quantum Channels2023
Breaking the Communication-Privacy-Accuracy Trilemma2023
Capacity of Noisy Permutation Channels2023
Codes for the Z-Channel2023
Coding for Polymer-Based Data Storage2023
Communication With Unreliable Entanglement Assistance2023
Community-Aware Group Testing2023
Community Detection With Contextual Multilayer Networks2023
Concatenated Codes for Multiple Reads of a DNA Sequence2023
Conditional Mean Estimation in Gaussian Noise: A Meta Derivative Identity With Applications2023
Consistent and Asymptotically Efficient Localization from Range-Difference Measurements2023
Constrained Learning With Non-Convex Losses2023
Constructions of Complementary Sequence Sets and Complete Complementary Codes by Ideal Two-Level Autocorrelation Sequences and Permutation Polynomials2023
Counting Processes With Piecewise-Deterministic Markov Conditional Intensity: Asymptotic Analysis, Implementation, and Information-Theoretic Use2023
Covering Grassmannian Codes: Bounds and Constructions2023
Covert Communication With Mismatched Decoders2023
Decision Theoretic Cutoff and ROC Analysis for Bayesian Optimal Group Testing2023
Density-Convoluted Support Vector Machines for High-Dimensional Classification2023
Dimension-Free Empirical Entropy Estimation2023
Distributed (ATC) Gradient Descent for High Dimension Sparse Regression2023
Distributed Sketching for Randomized Optimization: Exact Characterization, Concentration, and Lower Bounds2023
Divergence Estimation in Message Passing Algorithms2023
Energy Efficiency of Massive Random Access in MIMO Quasi-Static Rayleigh Fading Channels With Finite Blocklength2023
Entropic Central Limit Theorem for Order Statistics2023

« prev Page 10/80 next »