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
Rate region of Gaussian multiple description coding with individual and central distortion constraints2009
Remote vector Gaussian source coding with decoder side information under mutual information and distortion constraints2009
Representation and Compression of Multidimensional Piecewise Functions Using Surflets2009
Restricted isometry constants where lpsparse recovery can fail for 0 < p <= 12009
Restricted isometry constants where lsparse recovery can fail for 0 < p <= 12009
Robust recovery of signals from a structured union of subspaces2009
Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces2009
Secrecy Capacity Region of a Multiple-Antenna Gaussian Broadcast Channel With Confidential Messages2009
Self-Organization Properties of CSMA/CA Systems and Their Consequences on Fairness2009
Sharp bounds for optimal decoding of low-density parity-check codes2009
Sharp thresholds for high-dimensional and noisy sparsity recovery using l1-constrained quadratic programming (Lasso)2009
Shift-invariant protocol sequences for the collision channel without feedback2009
Sided and symmetrized Bregman centroids2009
Source and channel coding for correlated sources over multiuser channels2009
Spectrum Management for Interference-Limited Multiuser Communication Systems2009
Stability, fairness, and performance: a flow-level study on nonconvex and time-varying rate regions2009
Subspace pursuit for compressive sensing signal reconstruction2009
The Capacity Region of a Class of Semideterministic Interference Channels2009
The capacity region of the degraded multiple-input multiple-output compound broadcast channel2009
The Error Exponent of Variable-Length Codes Over Markov Channels With Feedback2009
The generalized area theorem and some of its consequences2009
The Trapping Redundancy of Linear Block Codes2009
The two-user compound interference channel2009
Tree-based ranking methods2009
Unequal error protection: an information-theoretic perspective2009
Universal models for the exponential distribution2009
Uplink macro diversity of limited backhaul cellular network2009
Vector Gaussian Multiple Description With Two Levels of Receivers2009
Weighted superimposed codes and constrained integer compressed sensing2009
A Calculus for Log-Convex Interference Functions2008
A Coincidence-Based Test for Uniformity Given Very Sparsely Sampled Discrete Data2008
Adaptive Methods for Linear Programming Decoding2008
A New Linear Programming Approach to Decoding Linear Block Codes2008
Antenna Packing in Low-Power Systems: Communication Limits and Array Design2008
A One-to-One Code and Its Anti-Redundancy2008
Asymptotic Analysis of Reduced-Feedback Strategies for MIMO Gaussian Broadcast Channels2008
Asymptotic Optimality Theory for Decentralized Sequential Hypothesis Testing in Sensor Networks2008
Asynchronous Iterative Water-Filling for Gaussian Frequency-Selective Interference Channels2008
Boolean Functions, Projection Operators, and Quantum Error Correcting Codes2008
Broadcast Capacity Region of Two-Phase Bidirectional Relaying2008
Broadcast in MIMO Systems Based on a Generalized QR Decomposition: Signaling and Performance Analysis2008
Capacity Bounds for Sticky Channels2008
Capacity of the Trapdoor Channel With Feedback2008
Coding for Additive White Noise Channels With Feedback Corrupted by Quantization or Bounded Noise2008
Colored Gaussian Source-Channel Broadcast for Heterogeneous (Analog/Digital) Receivers2008
Communication Over MIMO X Channels: Interference Alignment, Decomposition, and Performance Analysis2008
Communication Through Jamming Over a Slotted ALOHA Channel2008
Compound Multiple Access Channels with Partial Cooperation2008
Compressed Sensing and Redundant Dictionaries2008
Computation of Information Rates by Particle Methods2008

« prev Page 61/80 next »