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
A Poisson Decomposition for Information and the Information-Event Diagram2025
A Sample Efficient Alternating Minimization-Based Algorithm for Robust Phase Retrieval2025
Asymmetry of the Relative Entropy in the Regularization of Empirical Risk Minimization2025
Asymptotic Capacity of 1-bit MIMO Fading Channels2025
Asymptotic Distribution-Free Change-Point Detection for Modern Data Based on a New Ranking Scheme2025
A Two-Stage Solution to Quantum Process Tomography: Error Analysis and Optimal Design2025
Batched Nonparametric Contextual Bandits2025
Bayes Optimal Learning in High-Dimensional Linear Regression With Network Side Information2025
Better and Simpler Lower Bounds for Differentially Private Statistical Estimation2025
Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems With Smaller Sizes2025
Broadcast Channels With Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability2025
Byzantine-Resilient Gradient Coding Through Local Gradient Computations2025
ByzSecAgg: A Byzantine-Resistant Secure Aggregation Scheme for Federated Learning Based on Coded Computing and Vector Commitment2025
Capacity Bounds for Broadcast Channels With Bidirectional Conferencing Decoders2025
Capacity of Frequency-Based Channels: Encoding Information in Molecular Concentrations2025
Capacity Region for Covert Secret Key Generation Over Multiple Access Channels2025
Circular-Shift-Based Vector Linear Network Coding and Its Application to Array Codes2025
Classical Codes and Quantum Codes Involving the σ Inner Product2025
Classical Communication Cost of a Bipartite Quantum Channel Assisted by Non-Signaling Correlations2025
Coded Deep Learning: Framework and Algorithm2025
Coded Downlink Massive Random Access and a Finite de Finetti Theorem2025
Coding for Gaussian Two-Way Channels: Linear and Learning-Based Approaches2025
Common Information Dimension2025
Common Randomness Generation From Finite Compound Sources Aided by One-Way Communication2025
Complex Linear Physical-Layer Network Coding2025
Conditional Wasserstein Barycenters and Interpolation/Extrapolation of Distributions2025
Confirmation Bias in Gaussian Mixture Models2025
Convergence Analysis of Probability Flow ODE for Score-Based Generative Models2025
Corrections to "Nonparametric Two-Sample Testing by Betting"2025
Decentralized Adversarial Training Over Graphs2025
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models2025
Degree-D Reverse Multiplication-Friendly Embeddings2025
Derandomizing Codes for the Adversarial Wiretap Channel of Type II2025
Deterministic Identification Over Channels With Finite Output: A Dimensional Perspective on Superlinear Rates2025
Distribution-Preserving Integrated Sensing and Communication2025
Efficient Algorithms for Attributed Graph Alignment With Vanishing Edge Correlation2025
Efficient Best Arm Identification in Stochastic Bandits: Beyond β-Optimality2025
Efficient Federated Low Rank Matrix Completion2025
Ensemble-Tight Second-Order Asymptotics and Exponents for Guessing-Based Decoding With Abandonment2025
Entanglement Cost of Discriminating Quantum States Under Locality Constraints2025
Error Analysis of Three-Layer Neural Network Trained With PGD for Deep Ritz Method2025
Error Correction Decoding Algorithms of RS Codes Based on an Earlier Termination Algorithm to Find the Error Locator Polynomial2025
Exact Error Exponents of Concatenated Codes for DNA Storage2025
Explicit Subcodes of Reed-Solomon Codes That Efficiently Achieve List Decoding Capacity2025
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing2025
Fast Rate Information-Theoretic Bounds on Generalization Errors2025
Frame Multipliers and Compressive Sensing2025
Fundamental Limits of Non-Centered Non-Separable Channels and Their Application in Holographic MIMO Communications2025
Fundamental Limits of Two-Hop MIMO Channels: An Asymptotic Approach2025
Game of Coding: Beyond Honest-Majority Assumptions2025

« prev Page 3/80 next »