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
Optimal Multiplexed Erasure Codes for Streaming Messages With Different Decoding Delays2020
Optimal Source Codes for Timely Updates2020
Optimal Streaming Erasure Codes Over the Three-Node Relay Network2020
Optimization of Heterogeneous Coded Caching2020
Privacy in Index Coding: $k$ -Limited-Access Schemes2020
Privacy of Dependent Users Against Statistical Matching2020
Private Information Retrieval With Side Information2020
Private Streaming With Convolutional Codes2020
Provable Low Rank Phase Retrieval2020
Provably Secure Group Signature Schemes From Code-Based Assumptions2020
Quantum Channel Simulation and the Channel's Smooth Max-Information2020
Quantum Codes From Classical Graphical Models2020
Quickest Detection of Dynamic Events in Networks2020
Randomized Linear Algebra Approaches to Estimate the von Neumann Entropy of Density Matrices2020
Rate-Constrained Shaping Codes for Structured Sources2020
Rate-Memory Trade-Off for Caching and Delivery of Correlated Sources2020
Recovering Structured Data From Superimposed Non-Linear Measurements2020
Recursive Projection-Aggregation Decoding of Reed-Muller Codes2020
Reed-Muller Codes Polarize2020
Sample Complexity of Solving Non-Cooperative Games2020
Sampling of the Wiener Process for Remote Estimation Over a Channel With Random Delay2020
Second- and Third-Order Asymptotics of the Continuous-Time Poisson Channel2020
Second-Order Asymptotics of Sequential Hypothesis Testing2020
Secure Estimation Under Causative Attacks2020
Securing Multi-User Broadcast Wiretap Channels With Finite CSI Feedback2020
Single-Error Detection and Correction for Duplication and Substitution Channels2020
Single-Serving Quantum Broadcast Channel With Common, Individualized, and Confidential Messages2020
Sliding-Window Superposition Coding: Two-User Interference Channels2020
Smoothing Brascamp-Lieb Inequalities and Strong Converses of Coding Theorems2020
Sparse and Low-Rank Tensor Estimation via Cubic Sketchings2020
Sparse Combinatorial Group Testing2020
Sparse Composite Quantile Regression in Ultrahigh Dimensions With Tuning Parameter Calibration2020
Sparse Recovery Beyond Compressed Sensing: Separable Nonlinear Inverse Problems2020
Sparse Representation Classification Beyond ℓ1 Minimization and the Subspace Assumption2020
Spectral State Compression of Markov Processes2020
SqueezeFit: Label-Aware Dimensionality Reduction by Semidefinite Programming2020
Straggler Mitigation in Distributed Matrix Multiplication: Fundamental Limits and Optimal Coding2020
Strong Converse Using Change of Measure Arguments2020
Structured Local Optima in Sparse Blind Deconvolution2020
Structured Mappings and Conferencing Common Information for Multiple-Access Channels2020
Sublinear-Time Algorithms for Compressive Phase Retrieval2020
Sublinear-Time Non-Adaptive Group Testing With O(k log n) Tests via Bit-Mixing Coding2020
Sum-Set Inequalities From Aligned Image Sets: Instruments for Robust GDoF Bounds2020
Super-Resolution Limit of the ESPRIT Algorithm2020
Support Recovery in the Phase Retrieval Model: Information-Theoretic Fundamental Limit2020
Testing Bayesian Networks2020
The Approximate Capacity of Half-Duplex Line Networks2020
The Capacity Achieving Distribution for the Amplitude Constrained Additive Gaussian Channel: An Upper Bound on the Number of Mass Points2020
The Capacity of Private Information Retrieval From Uncoded Storage Constrained Databases2020
The Explicit Coding Rate Region of Symmetric Multilevel Diversity Coding2020

« prev Page 22/80 next »