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
Defect Tolerance: Fundamental Limits and Examples2018
Degraded Broadcast Channel With Secrecy Outside a Bounded Range2018
Demystifying Fixed k-Nearest Neighbor Information Estimators2018
Denoising Flows on Trees2018
Determining Optimal Rates for Communication for Omniscience2018
Discrete Fourier Transform of Boolean Functions over the Complex Field and Its Applications2018
Distortion Bounds for Source Broadcast Problems2018
Distributed Detection in Ad Hoc Networks Through Quantized Consensus2018
Distributed Testing With Cascaded Encoders2018
Efficient Byzantine Sequential Change Detection2018
Energy Propagation in Deep Convolutional Neural Networks2018
Equivalence of Additive-Combinatorial Linear Inequalities for Shannon Entropy and Differential Entropy2018
Estimation of KL Divergence: Optimal Minimax Rate2018
Exponential Strong Converse for Content Identification With Lossy Recovery2018
Extended Gray-Wyner System With Complementary Causal Side Information2018
Extreme Compressive Sampling for Covariance Estimation.2018
FFAST: An Algorithm for Computing an Exactly k-Sparse DFT in O(k log k) Time2018
Finite Sample Analysis of Approximate Message Passing Algorithms2018
Finite-Sample Risk Bounds for Maximum Likelihood Estimation With Arbitrary Penalties2018
From Compressed Sensing to Compressed Bit-Streams: Practical Encoders, Tractable Decoders2018
Fundamental Distortion Limits of Analog-to-Digital Compression2018
Gaussian Distributions on Riemannian Symmetric Spaces: Statistical Learning With Structured Covariance Matrices2018
GDoF Region of the MISO BC: Bridging the Gap Between Finite Precision and Perfect CSIT2018
Generalized Line Spectral Estimation via Convex Optimization2018
Geometric Orthogonal Codes of Size Larger Than Optical Orthogonal Codes2018
How to Achieve the Capacity of Asymmetric Channels2018
How to Share a Secret, Infinitely2018
Improved Converses and Gap Results for Coded Caching2018
Inexact Gradient Projection and Fast Data Driven Compressed Sensing2018
Information-Theoretically Secure Erasure Codes for Distributed Storage2018
Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization2018
Information-Theoretic Privacy for Smart Metering Systems with a Rechargeable Battery2018
Interactive Communication for Data Exchange2018
Keyless Authentication and Authenticated Capacity2018
Learning Graphical Models From the Glauber Dynamics2018
Linear Regression With Shuffled Data: Statistical and Computational Limits of Permutation Recovery2018
Linear Size Constant-Composition Codes Meeting the Johnson Bound2018
List Decoding of Insertions and Deletions2018
Locally Repairable Codes With Unequal Local Erasure Correction2018
Locally Testable and Locally Correctable Codes approaching the Gilbert-Varshamov Bound2018
Lossless Compression of Binary Trees With Correlated Vertex Names2018
Lossy Coding of Correlated Sources Over a Multiple Access Channel: Necessary Conditions and Separation Results2018
LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes2018
Making Recommendations Bandwidth Aware2018
Matching Anonymized and Obfuscated Time Series to Users’ Profiles2018
Maximal Correlation Secrecy2018
Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality2018
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth.2018
Median-Truncated Nonconvex Approach for Phase Retrieval With Outliers2018
Minimax Estimation of the L1 Distance2018

« prev Page 28/80 next »