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
Criss-Cross Insertion and Deletion Correcting Codes2021
Cutoff for Exact Recovery of Gaussian Mixture Models2021
Data Encoding for Byzantine-Resilient Distributed Optimization2021
Decoding of Interleaved Alternant Codes2021
Deep Neural Network Approximation Theory2021
Detecting an Odd Restless Markov Arm With a Trembling Hand2021
Deterministic Constructions of Compressed Sensing Matrices From Unitary Geometry2021
Directed Intersection Representations and the Information Content of Digraphs2021
Distributed Online Linear Regressions2021
Distributed Source Simulation With No Communication2021
Distributed Stochastic Optimization in Networks With Low Informational Exchange2021
DNA-Based Storage: Models and Fundamental Limits2021
Efficient and Robust Distributed Matrix Computations via Convolutional Coding2021
Efficient Approximate Minimum Entropy Coupling of Multiple Probability Distributions2021
Ensemble Estimation of Generalized Mutual Information With Applications to Genomics2021
Error-Correcting Codes for Noisy Duplication Channels2021
Error Decoding of Locally Repairable and Partial MDS Codes2021
Fairness Under Feature Exemptions: Counterfactual and Observational Measures2021
Fourier-Analysis-Based Form of Normalized Maximum Likelihood: Exact Formula and Relation to Complex Bayesian Prior2021
From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein2021
Fundamental Limits of Distributed Linear Encoding2021
Fundamental Limits of Many-User MAC With Finite Payloads and Fading2021
Gaussian 1-2-1 Networks: Capacity Results for mmWave Communications2021
Gaussian Approximation of Quantization Error for Estimation From Compressed Data2021
Generalization Error Bounds via Rényi-, f-Divergences and Maximal Leakage2021
Generalized Sphere-Packing Bound for Subblock-Constrained Codes2021
Geometric Lower Bounds for Distributed Parameter Estimation Under Communication Constraints2021
Goodness-of-Fit Tests on Manifolds2021
Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein"2021
Guest Editorial Special Issue: “From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein”2021
Householder Dice: A Matrix-Free Algorithm for Simulating Dynamics on Gaussian and Random Orthogonal Ensembles2021
How to Reduce Dimension With PCA and Random Projections?2021
Improved Bounds and Singleton-Optimal Constructions of Locally Repairable Codes With Minimum Distance 5 and 62021
Improved Non-Adaptive Algorithms for Threshold Group Testing With a Gap2021
Improving Computational Efficiency of Communication for Omniscience and Successive Omniscience2021
Inference in High-Dimensional Linear Regression via Lattice Basis Reduction and Integer Relation Detection2021
Information-Distilling Quantizers2021
Information Storage in the Stochastic Ising Model2021
Information Theoretical Clustering Is Hard to Approximate2021
Information-Theoretic Analysis of OFDM With Subcarrier Number Modulation2021
Instance-Dependent ℓ∞-Bounds for Policy Evaluation in Tabular Reinforcement Learning2021
Interference Alignment for the K-User MIMO Interference Channel2021
Learning Mixtures of Low-Rank Models2021
Levenshtein Distance, Sequence Comparison and Biological Database Search2021
Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications2021
Long Optimal and Small-Defect LRC Codes With Unbounded Minimum Distances2021
Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes Using Linear Programming2021
Malicious Experts Versus the Multiplicative Weights Algorithm in Online Prediction2021
Manifold Gradient Descent Solves Multi-Channel Sparse Blind Deconvolution Provably and Efficiently2021
MDS Codes With Galois Hulls of Arbitrary Dimensions and the Related Entanglement-Assisted Quantum Error Correction2021

« prev Page 17/80 next »