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
The Capacity Region of p -Transmitter/ q -Receiver Multiple-Access Channels With Common Information2011
The Compound Multiple Access Channel With Partially Cooperating Encoders2011
The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing2011
The Error-Pattern-Correcting Turbo Equalizer: Spectrum Thinning at High SNRs2011
The Geometry of Generalized Binary Search2011
The Noise-Sensitivity Phase Transition in Compressed Sensing2011
The Secrecy Capacity of the MIMO Wiretap Channel2011
The Shannon Cipher System With a Guessing Wiretapper: General Sources2011
The Source Coding Game With a Cheating Switcher2011
Thresholded Basis Pursuit: LP Algorithm for Order-Wise Optimal Support Recovery for Sparse and Approximately Sparse Signals From Noisy Random Measurements2011
Throughput and Latency in Finite-Buffer Line Networks2011
To Decode the Interference or to Consider It as Noise2011
VLSI Architectures for Soft-Decision Decoding of Reed-Solomon Codes2011
When Is a Function Securely Computable?2011
Wireless Network Information Flow: A Deterministic Approach2011
A channel model for inferring the optimal number of electrodes for future cochlear implants2010
A general upper bound on the size of constant-weight conflict-avoiding codes2010
Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes2010
Analysis of orthogonal matching pursuit using the restricted isometry property2010
An MGF-Based Unified Framework to Determine the Joint Statistics of Partial Sums of Ordered Random Variables2010
Anthropic correction of information estimates and its application to neural coding2010
Approximation of Wide-Sense Stationary Stochastic Processes by Shannon Sampling Series2010
A Random Search Framework for Convergence Analysis of Distributed Beamforming With Feedback2010
Asymmetric multilevel diversity coding and asymmetric Gaussian multiple descriptions2010
Asymptotic analysis of robust LASSOs in the presence of noise with large variance2010
Asynchronous CDMA systems with random spreading-part I: fundamental limits2010
Asynchronous CDMA systems with random spreading-part II: design criteria2010
A universal scheme for Wyner-Ziv coding of discrete sources2010
A vector generalization of costa's entropy-power inequality with applications2010
Average case analysis of multichannel sparse recovery using convex relaxation2010
Average message delivery time for small-world networks in the continuum limit2010
Bayesian Minimax Estimation of the Normal Model With Incomplete Prior Covariance Matrix Specification2010
Behavior of the quantization operator for bandlimited, nonoversampled signals2010
Beyond Nyquist: efficient sampling of sparse bandlimited signals2010
Binary almost-perfect sequence sets2010
Buffer Asymptotics for Coding Over Networks2010
Capacity of Channels With Action-Dependent States2010
Capacity regions and sum-rate capacities of vector Gaussian interference channels2010
Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation2010
Causal inference using the algorithmic Markov condition2010
Channel coding rate in the finite blocklength regime2010
Codes for deletion and insertion channels with segmented errors2010
Codes in permutations and error correction for rank modulation2010
Constant-rank codes and their connection to constant-dimension codes2010
Constructions of cryptographically significant boolean functions using primitive polynomials2010
Convergence of min-sum message-passing for convex optimization2010
Cooperative relaying with state available noncausally at the relay2010
Correction to "on functional duality in multiuser source and channel coding problems having one-sidedcollaboration"2010
Cyclic distributed space-time codes for wireless relay networks with no channel information2010
Dense error correction via l1-minimization2010

« prev Page 56/80 next »