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
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels2017
Strong Secrecy for Cooperative Broadcast Channels2017
Testing Equality in Communication Graphs2017
The Composition Theorem for Differential Privacy2017
The Degrees of Freedom of the Interference Channel With a Cognitive Relay Under Delayed Feedback2017
The Discrete Dantzig Selector: Estimating Sparse Linear Models via Mixed Integer Linear Optimization2017
The Dispersion of Nearest-Neighbor Decoding for Additive Non-Gaussian Channels2017
The MDS Queue: Analysing the Latency Performance of Erasure Codes2017
The Rate-Distortion Function and Excess-Distortion Exponent of Sparse Regression Codes With Optimal Encoding2017
The Secrecy Capacity of Gaussian MIMO Channels With Finite Memory2017
The Sum Rate of Vector Gaussian Multiple Description Coding With Tree-Structured Covariance Distortion Constraints2017
The Three-Terminal Interactive Lossy Source Coding Problem2017
Transmitter Cooperation Under Finite Precision CSIT: A GDoF Perspective2017
Two Families of LCD BCH Codes2017
Two-Stage Sampling, Prediction and Adaptive Regression via Correlation Screening.2017
Universal Compressed Sensing for Almost Lossless Recovery2017
Universal Multiparty Data Exchange and Secret Key Agreement2017
Update or Wait: How to Keep Your Data Fresh2017
When is Noisy State Information at the Encoder as Useless as No Information or as Good as Noise-Free State?2017
Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes2017
Zero-Difference Balanced Functions With New Parameters and Their Applications2017
Zero-Error Capacity of P-ary Shift Channels and FIFO Queues2017
$k$ -Connectivity in Random $K$ -Out Graphs Intersecting Erdős-Rényi Graphs2016
A Channel Under Simultaneous Jamming and Eavesdropping Attack - Correlated Random Coding Capacities Under Strong Secrecy Criteria2016
Achieving Full DoF in Heterogeneous Parallel Broadcast Channels With Outdated CSIT2016
A Combinatorial Construction for Strictly Optimal Frequency-Hopping Sequences2016
Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing2016
An Analysis of Block Sampling Strategies in Compressed Sensing2016
An Ergodic Theory of Binary Operations - Part I: Key Properties2016
An LP Characterization of the Secret-message Capacity of Three Erasure Networks With Feedback2016
A Numerical Study on the Wiretap Network With a Simple Network Topology2016
A Proof of the Strong Converse Theorem for Gaussian Multiple Access Channels2016
Arbitrarily Varying Wiretap Channels With Type Constrained States2016
A Receiver-centric Approach to Interference Management: Fairness and Outage Optimization2016
A Simple Proof for the Existence of "Good" Pairs of Nested Lattices2016
A Source-Channel Separation Theorem With Application to the Source Broadcast Problem2016
Asymptotic Minimax Robust Quickest Change Detection for Dependent Stochastic Processes With Parametric Uncertainty2016
A Unified Graphical Approach to Random Coding for Single-Hop Networks2016
BASIC Codes: Low-Complexity Regenerating Codes for Distributed Storage Systems2016
Batch Codes Through Dense Graphs Without Short Cycles2016
Batch Codes Through Dense Graphs Without Short Cycles.2016
Bounds for Permutation Rate-Distortion2016
Bounds on the Parameters of Locally Recoverable Codes2016
Capacity Characterization for State-Dependent Gaussian Channel With a Helper2016
Capacity of a Class of State-Dependent Orthogonal Relay Channels2016
Capacity of the Energy-Harvesting Channel With a Finite Battery2016
Capacity Theorems for Broadcast Channels With Two Channel State Components Known at the Receivers2016
Channel Diversity Needed for Vector Space Interference Alignment2016
Classification and Reconstruction of High-Dimensional Signals From Low-Dimensional Features in the Presence of Side Information2016
Code Construction and Decoding Algorithms for Semi-Quantitative Group Testing With Nonuniform Thresholds2016

« prev Page 34/80 next »