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
Fluctuations of an Improved Population Eigenvalue Estimator in Sample Covariance Matrix Models2013
Fluctuations of Spiked Random Matrix Models and Failure Diagnosis in Sensor Networks2013
Gaussian Robust Sequential and Predictive Coding2013
Half-Duplex Relaying Over Slow Fading Channels Based on Quantize-and-Forward2013
Heegard-Berger and Cascade Source Coding Problems With Common Reconstruction Constraints2013
How Correlations Influence Lasso Prediction2013
How Many Queries Will Resolve Common Randomness?2013
Hybrid Noncoherent Network Coding2013
Identification of Sparse Linear Operators2013
Improved Bounds for the Nyström Method With Application to Kernel Classification2013
Incremental Relaying for the Gaussian Interference Channel With a Degraded Broadcasting Relay2013
Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing2013
Information Theory of DNA Shotgun Sequencing2013
Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation2013
Interference Alignment: From Degrees of Freedom to Constant-Gap Capacity Approximations2013
Iterative Coding for Network Coding2013
Joint k-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares2013
Joint Sensing and Power Allocation in Nonconvex Cognitive Radio Games: Nash Equilibria and Distributed Algorithms2013
LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing2013
Learning in a Changing World: Restless Multiarmed Bandit With Unknown Dynamics2013
Local Pinsker Inequalities via Stein's Discrete Density Approach2013
Low-Rank Matrix Recovery From Errors and Erasures2013
LT-W: Improving LT Decoding With Wiedemann Solver2013
Markov Approximation for Combinatorial Network Optimization2013
Maximum Distance Separable Codes for Symbol-Pair Read Channels2013
Measurement Bounds for Sparse Signal Ensembles via Graphical Models2013
Memoryless Multiple Access Channel With Asymmetric Noisy State Information at the Encoders2013
MIMO Multiple Access Channel With an Arbitrarily Varying Eavesdropper: Secrecy Degrees of Freedom2013
Modeling the Pairwise Key Predistribution Scheme in the Presence of Unreliable Links2013
Multiple Access Channels With States Causally Known at Transmitters2013
Multiple-Input Multiple-Output Two-Way Relaying: A Space-Division Approach2013
Multiterminal Source Coding With Action-Dependent Side Information2013
Multiuser Broadcast Erasure Channel With Feedback - Capacity and Algorithms2013
Near-Optimal Coresets for Least-Squares Regression2013
Near-Optimal Quantization and Linear Network Coding for Relay Networks2013
New Constructions of Zero-Correlation Zone Sequences2013
New Polyphase Sequence Families With Low Correlation Derived From the Weil Bound of Exponential Sums2013
New Results on Multiple-Input Multiple-Output Broadcast Channels With Confidential Messages2013
Noisy-Interference Sum-Rate Capacity for Vector Gaussian Interference Channels2013
Nonasymptotic Upper Bounds for Deletion Correcting Codes2013
On an Achievable Rate of Large Rayleigh Block-Fading MIMO Channels With No CSI2013
On Learning With Finite Memory2013
On Modulo-Sum Computation Over an Erasure Multiple-Access Channel2013
On the Capacity of Indecomposable Finite-State Channels With Feedback2013
On the Capacity of the K-User Cyclic Gaussian Interference Channel2013
On the Capacity Region and the Generalized Degrees of Freedom Region for the MIMO Interference Channel With Feedback2013
On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution2013
On the Feedback Capacity of the Fully Connected $K$-User Interference Channel2013
On the Final Exponentiation in Tate Pairing Computations2013
On the Fundamental Limits of Adaptive Sensing2013

« prev Page 47/80 next »