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
Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs2018
Sharp Time-Data Tradeoffs for Linear Inverse Problems2018
Social Learning and Distributed Hypothesis Testing2018
Solving Systems of Random Quadratic Equations via Truncated Amplitude Flow.2018
Source Estimation in Time Series and the Surprising Resilience of HMMs2018
Sparse Representation in Fourier and Local Bases Using ProSparse: A Probabilistic Analysis2018
Spatially Coupled Split-Component Codes With Iterative Algebraic Decoding2018
Spatiotemporal Information Coupling in Network Navigation2018
Speeding Up Distributed Machine Learning Using Codes2018
Staircase Codes for Secret Sharing With Optimal Communication and Read Overheads2018
State-Dependent Gaussian Multiple Access Channels: New Outer Bounds and Capacity Results2018
Streaming Codes for Multiplicative-Matrix Channels With Burst Rank Loss2018
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels.2018
Strong Functional Representation Lemma and Applications to Coding Theorems2018
Strong Secrecy for Interference Channels Based on Channel Resolvability2018
Sum-Networks From Incidence Structures: Construction and Capacity Analysis2018
Symmetric Pseudo-Random Matrices2018
Symmetry. Saddle Points, and Global Optimization Landscape of Nonconvex Matrix Factorization2018
Tensor SVD: Statistical and Computational Limits2018
“The Capacity of the Relay Channel”: Solution to Cover’s Problem in the Gaussian Case2018
The Conditional Common Information in Classical and Quantum Secret Key Distillation2018
The Distortion Rate Function of Cyclostationary Gaussian Processes2018
The Effect of Local Decodability Constraints on Variable-Length Compression2018
The Ergodic Capacity of the Multiple Access Channel Under Distributed Scheduling - Order Optimality of Linear Receivers2018
The Exact Rate-Memory Tradeoff for Caching With Uncoded Prefetching2018
The MIMO Wiretap Channel Decomposed2018
The Two-Unicast Problem2018
The Velocity of the Propagating Wave for Spatially Coupled Systems With Applications to LDPC Codes2018
The Wiretapped Diamond-Relay Channel2018
Two-Way Interference Channel Capacity: How to Have the Cake and Eat It Too2018
Unequal Error Protection Querying Policies for the Noisy 20 Questions Problem2018
Unified Theory for Recovery of Sparse Signals in a General Transform Domain2018
Variable Packet-Error Coding2018
Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding2018
Wyner's Common Information Under Rényi Divergence Measures2018
Zero-Delay Source-Channel Coding With a Low-Resolution ADC Front End2018
Achievable Rates for Gaussian Degraded Relay Channels With Non-Vanishing Error Probabilities2017
A Clustering Approach to Learning Sparsely Used Overcomplete Dictionaries2017
A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius"2017
Adaptive Compressed Sensing for Support Recovery of Structured Sparse Sets2017
Adversarial Top-K Ranking2017
A Large Deviations Approach to Secure Lossy Compression2017
All Binary Linear Codes That Are Invariant Under <inline-formula> <tex-math notation="LaTeX">${\mathrm{PSL}}_2(n)$ </tex-math> </inline-formula>2017
Almost Lossless Analog Signal Separation and Probabilistic Uncertainty Relations2017
An Ergodic Theory of Binary Operations - Part II: Applications to Polarization2017
An Outer Bound on the Storage-Bandwidth Tradeoff of Exact-Repair Cooperative Regenerating Codes2017
A Piggybacking Design Framework for Read-and Download-Efficient Distributed Storage Codes2017
Approximate Degradable Quantum Channels2017
Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes2017
A Proof of the Strong Converse Theorem for Gaussian Broadcast Channels via the Gaussian Poincaré Inequality2017

« prev Page 30/80 next »