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
Diversity-Multiplexing Tradeoff in ISI Channels2009
Efficient and robust compressed sensing using optimized expander graphs2009
Energy efficiency-delay tradeoffs in CDMA networks: a game-theoretic approach2009
Fairness in multiuser systems with polymatroid capacity region2009
Finding all small error-prone substructures in LDPC codes2009
Finite-Length Scaling for Iteratively Decoded LDPC Ensembles2009
Finite State Channels With Time-Invariant Deterministic Feedback2009
Fundamentals of Wireless Communication (Tse, D. and Viswanath, P.) [Book review]2009
Guessing facets: polytope structure and improved LP decoder.2009
Hessian and Concavity of Mutual Information, Differential Entropy, and Entropy Power in Linear Vector Gaussian Channels2009
Hierarchical cooperation in ad hoc networks: optimal clustering and achievable throughput2009
How much information can one get from a wireless ad hoc sensor network over a correlated random field?2009
Individual sequence prediction using memory-efficient context trees2009
Information theoretic analysis of proactive routing overhead in mobile ad hoc networks2009
Information-theoretic limits on sparsity recovery in the high-dimensional and noisy setting2009
Joint universal lossy coding and identification of stationary mixing sources with general alphabets2009
Large System Spectral Analysis of Covariance Matrix Estimation2009
Least conservative support and tolerance tubes2009
Local Base Station Cooperation Via Finite-Capacity Links for the Uplink of Linear Cellular Networks2009
Low-Density Graph Codes That Are Optimal for Binning and Coding With Side Information2009
Message passing for maximum weight independent set2009
Multiple description coding for stationary Gaussian sources2009
Near-Capacity Dirty-Paper Code Design: A Source-Channel Coding Approach2009
New Results on Multiple Descriptions in the Wyner-Ziv Setting2009
New Upper Bound for $(m, k, \lambda )$-IRSs With $\lambda \geq 2$2009
On capacity scaling in arbitrary wireless networks2009
On Certain Large Random Hermitian Jacobi Matrices With Applications to Wireless Communications2009
On ergodic sum capacity of fading cognitive multiple-access and broadcast channels2009
One shot schemes for decentralized quickest change detection2009
On maximizing coverage in Gaussian relay channels2009
On properties of locally optimal multiple description scalar quantizers with convex cells2009
On recovery of sparse signals via l1 minimization2009
On the diversity gain of AF and DF relaying with noisy CSI at the source transmitter2009
On the duality between Slepian-Wolf coding and channel coding under mismatched decoding2009
On the linear codebook-level duality between Slepian-Wolf coding and channel coding2009
On the redundancy of Slepian--Wolf coding2009
On the sum-capacity of degraded Gaussian multiple-access relay channels2009
On the Throughput of Secure Hybrid-ARQ Protocols for Gaussian Block-Fading Channels2009
Opportunistic relaying in wireless networks2009
Optimal design of sequential real-time communication systems2009
Optimality of myopic sensing in multichannel opportunistic access2009
Optimal Monotone Encodings2009
Orthogonal Space-Time Block Codes With Sphere Packing2009
Outage behavior of discrete memoryless channels under channel estimation errors2009
Outer bounds for multiple-access channels with feedback using dependence balance2009
Parity Forwarding for Multiple-Relay Networks2009
Probabilistic coherence and proper scoring rules2009
Queue back-pressure random access in multihop wireless networks: optimality and stability2009
Rate of channel hardening of antenna selection diversity schemes and its implication on scheduling2009
Rate of convergence in approximating the spectral factor of regular stochastic sequences2009

« prev Page 60/80 next »