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
Matching Anonymized and Obfuscated Time Series to Users' Profiles2019
Message Transmission Over Classical Quantum Channels With a Jammer With Side Information: Message Transmission Capacity and Resources2019
MIMO Gaussian Broadcast Channels With Common, Private, and Confidential Messages2019
Minimizing the Age of Information Through Queues2019
Moderate Deviation Asymptotics for Variable-Length Codes With Feedback2019
Multireference Alignment Is Easier With an Aperiodic Translation Distribution2019
Nearly Optimal Constructions of PIR and Batch Codes2019
Nearly Optimal Sparse Group Testing2019
Near Optimal Coded Data Shuffling for Distributed Learning2019
Network Estimation From Point Process Data2019
Network Simplification in Half-Duplex: Building on Submodularity2019
New Bounds and Generalizations of Locally Recoverable Codes With Availability2019
Noisy Adaptive Group Testing: Bounds and Algorithms2019
Non-Asymptotic Achievable Rates for Gaussian Energy-Harvesting Channels: Save-and-Transmit and Best-Effort2019
Non-Asymptotic Converse Bounds and Refined Asymptotics for Two Source Coding Problems2019
Non-Asymptotic Entanglement Distillation2019
Nonparametric Identification in the Dynamic Stochastic Block Model2019
On Converse Bounds for Classical Communication Over Quantum Channels2019
On Function Computation With Privacy and Secrecy Constraints2019
On the Capacity of Cloud Radio Access Networks With Oblivious Relaying2019
On the Capacity of the Peak Power Constrained Vector Gaussian Channel: An Estimation Theoretic Perspective2019
On the Convergence of Approximate Message Passing With Arbitrary Matrices2019
On the Entropy Power Inequality for the Rényi Entropy of Order [0, 1]2019
On the Maximum Size of Block Codes Subject to a Distance Criterion2019
On the Minimal Overcompleteness Allowing Universal Sparse Representation2019
On the Minimax Misclassification Ratio of Hypergraph Community Detection2019
On the Optimality of the Kautz-Singleton Construction in Probabilistic Group Testing2019
On the Reliability Function of Distributed Hypothesis Testing Under Optimal Detection2019
On the Sample Complexity of Multichannel Frequency Estimation via Convex Optimization2019
On the Sub-Optimality of Single-Letter Coding Over Networks2019
Optimality of Simple Layered Superposition Coding in the 3 User MISO BC With Finite Precision CSIT2019
Optimal Locally Repairable Codes of Distance 3 and 4 via Cyclic Codes2019
Optimal Streaming Codes for Channels With Burst and Arbitrary Erasures2019
Optimization-Based AMP for Phase Retrieval: The Impact of Initialization and $\ell_{2}$ Regularization2019
Optimization of Smooth Functions With Noisy Observations: Local Minimax Rates2019
Optimum Linear Codes With Support-Constrained Generator Matrices Over Small Fields2019
Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM2019
Performance of Group Testing Algorithms With Near-Constant Tests Per Item2019
Phase Transition Analysis for Covariance Based Massive Random Access with Massive MIMO2019
Physical-Layer Schemes for Wireless Coded Caching2019
Polar Coding for Processes With Memory2019
Privacy With Estimation Guarantees2019
Provable Subspace Clustering: When LRR Meets SSC2019
Quantum Capacity Bounds of Gaussian Thermal Loss Channels and Achievable Rates With Gottesman-Kitaev-Preskill Codes2019
Quantum Query Complexity of Entropy Estimation2019
Quantum State Merging for Arbitrarily Small-Dimensional Systems2019
Quasi Structured Codes for Multi-Terminal Communications2019
Quickest Change Detection Under Transient Dynamics: Theory and Asymptotic Analysis2019
Rack-Aware Regenerating Codes for Data Centers2019
Recovery and Convergence Rate of the Frank-Wolfe Algorithm for the m-Exact-Sparse Problem2019

« prev Page 25/80 next »