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
On the Global Optimality of Whittle's Index Policy for Minimizing the Age of Information2022
On the Rate of Convergence of a Classifier Based on a Transformer Encoder2022
On the Similarity Between von Neumann Graph Entropy and Structural Information: Interpretation, Computation, and Applications2022
On the Subcode-Support-Weight Distributions of Some Classes of Optimal Codes2022
On Universal D-Semifaithful Coding for Memoryless Sources With Infinite Alphabets2022
Optimal Age Over Erasure Channels2022
Optimal Convergence Rates for the Orthogonal Greedy Algorithm2022
Optimal Distributed Composite Testing in High-Dimensional Gaussian Models With 1-Bit Communication2022
Optimal High-Order Tensor SVD via Tensor-Train Orthogonal Iteration2022
Optimal Locally Repairable Codes: An Improved Bound and Constructions2022
Optimal Nonparametric Multivariate Change Point Detection and Localization2022
Optimizing Age-of-Information in Adversarial and Stochastic Environments2022
Optimizing Variational Representations of Divergences and Accelerating Their Statistical Estimation2022
Partially Concatenated Calderbank-Shor-Steane Codes Achieving the Quantum Gilbert-Varshamov Bound Asymptotically2022
Phase Transition Analysis for Covariance-Based Massive Random Access With Massive MIMO2022
Precoding and Scheduling for AoI Minimization in MIMO Broadcast Channels2022
Provable Compressed Sensing With Generative Priors via Langevin Dynamics2022
Q-Ary Non-Overlapping Codes: A Generating Function Approach2022
Quadratically Constrained Myopic Adversarial Channels2022
Quadratic Privacy-Signaling Games and the MMSE Information Bottleneck Problem for Gaussian Sources2022
Quantum Differentially Private Sparse Regression Learning2022
Quantum Sampling for Finite Key Rates in High Dimensional Quantum Cryptography2022
Quaternary Linear Codes and Related Binary Subfield Codes2022
Repairing Reed-Solomon Codes Evaluated on Subspaces2022
Resolution Limits of Non-Adaptive 20 Questions Search for Multiple Targets2022
Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction2022
Sampling With Replacement vs Poisson Sampling: A Comparative Study in Optimal Subsampling2022
Second-Order Asymptotically Optimal Outlier Hypothesis Testing2022
Secure Distributed Matrix Computation With Discrete Fourier Transform2022
Semantic Security with Infinite Dimensional Quantum Eavesdropping Channel2022
Sequential Multi-Hypothesis Testing in Multi-Armed Bandit Problems: An Approach for Asymptotic Optimality2022
Sequential Transmission Over Binary Asymmetric Channels With Feedback2022
Simple Coding Techniques for Many-Hop Relaying2022
SLOPE for Sparse Linear Regression: Asymptotics and Optimal Regularization2022
Some Upper Bounds and Exact Values on Linear Complexities Over FM of Sidelnikov Sequences for M = 2 and 32022
Sparse Group Lasso: Optimal Sample Complexity, Convergence Rate, and Statistical Inference2022
Sparse Nonnegative Tensor Factorization and Completion With Noisy Observations2022
Stability and Risk Bounds of Iterative Hard Thresholding2022
State-Dependent Symbol-Wise Decode and Forward Codes Over Multihop Relay Networks2022
Strong Data Processing Constant Is Achieved by Binary Inputs2022
Strong Secrecy of Arbitrarily Varying Wiretap Channel With Constraints2022
Sufficiently Informative and Relevant Features: An Information-Theoretic and Fourier-Based Characterization2022
Symmetric Private Polynomial Computation From Lagrange Encoding2022
The Benefits of Diversity: Permutation Recovery in Unlabeled Sensing From Multiple Measurement Vectors2022
The Differential Entropy of Mixtures: New Bounds and Applications2022
The DNA Storage Channel: Capacity and Error Probability Bounds2022
The Eigenvectors of Single-Spiked Complex Wishart Matrices: Finite and Asymptotic Analyses2022
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free2022
The Price of Competition: Effect Size Heterogeneity Matters in High Dimensions2022
The Quantum Multiple-Access Channel With Cribbing Encoders2022

« prev Page 15/80 next »