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
Rateless Lossy Compression via the Extremes2016
Representer Theorems for Sparsity-Promoting ℓ1 Regularization2016
Representer Theorems for Sparsity-Promoting ℓRegularization2016
Representer Theorems for Sparsity-Promoting <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math> </inline-formula> Regularization2016
Restricted Composition Deletion Correcting Codes2016
Restricted Isometry Property for General p-Norms2016
Restricted q-Isometry Properties Adapted to Frames for Nonconvex lq-Analysis2016
Scaling Laws for Noncoherent Energy-Based Communications in the SIMO MAC2016
Secret Key Agreement: General Capacity and Second-Order Asymptotics2016
Secret-Key Agreement Over Non-Coherent Block-Fading Channels With Public Discussion2016
Secret Sharing, Rank Inequalities, and Information Inequalities2016
Secure Source Coding With a Public Helper2016
Security in Locally Repairable Storage2016
Semantic-Security Capacity for Wiretap Channels of Type II2016
Shannon暗号システムのための情報源-通信路の秘密【Powered by NICT】2016
SHO-FA: Robust Compressive Sensing With Order-Optimal Complexity, Measurements, and Bits2016
Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius2016
Spatial Coupling as a Proof Technique and Three Applications2016
State Amplification Subject to Masking Constraints2016
State-Dependent Gaussian Interference Channels: Can State Be Fully Canceled?2016
Streaming Data Transmission in the Moderate Deviations and Central Limit Regimes2016
Strengthened Monotonicity of Relative Entropy via Pinched Petz Recovery Map2016
Strictly Optimal Frequency-Hopping Sequence Sets With Optimal Family Sizes2016
Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach2016
Strong Data Processing Inequalities and <inline-formula> <tex-math notation="LaTeX">$\Phi $ </tex-math> </inline-formula>-Sobolev Inequalities for Discrete Channels2016
Strong Data Processing Inequalities and Φ-Sobolev Inequalities for Discrete Channels2016
Strong Successive Refinability and Rate-Distortion-Complexity Tradeoff2016
Structural Information and Dynamical Complexity of Networks2016
Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer2016
Successive Omniscience2016
Successive Segmentation-Based Coding for Broadcasting Over Erasure Channels2016
Superadditivity of Quantum Channel Coding Rate With Finite Blocklength Joint Measurements.2016
Superposition Coding Is Almost Always Optimal for the Poisson Broadcast Channel2016
The Arbitrarily Varying Wiretap Channel - Secret Randomness, Stability, and Super-Activation2016
The Bethe Free Energy Allows to Compute the Conditional Entropy of Graphical Code Instances: A Proof From the Polymer Expansion2016
The Capacity of String-Duplication Systems2016
The Cayley Graphs Associated With Some Quasi-Perfect Lee Codes Are Ramanujan Graphs2016
The Likelihood Encoder for Lossy Compression2016
The Optimal Noise-Adding Mechanism in Differential Privacy2016
The Two-User Causal Cognitive Interference Channel: Novel Outer Bounds and Constant Gap Result for the Symmetric Gaussian Noise Channel in Weak Interference2016
Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel2016
Tight Bound on Randomness for Violating the Clauser-Horne-Shimony-Holt Inequality2016
Toward Optimal Secure Distributed Storage Systems With Exact Repair2016
Tracking Dynamic Point Processes on Networks2016
Types of Markov Fields and Tilings2016
Unequal Error Protection Querying Policies for the Noisy 20 Questions Problem.2016
Unified Scaling of Polar Codes: Error Exponent, Scaling Exponent, Moderate Deviations, and Error Floors2016
Universal Polarization2016
Upper Bound on List-Decoding Radius of Binary Codes2016
Vandermonde Decomposition of Multilevel Toeplitz Matrices With Application to Multidimensional Super-Resolution2016

« prev Page 37/80 next »