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
Coded Cooperative Data Exchange for a Secret Key2016
Codes Correcting Erasures and Deletions for Rank Modulation2016
Codes for DNA Sequence Profiles2016
Codes for Partially Stuck-At Memory Cells2016
Comments on "Approximate Characterizations for the Gaussian Source Broadcast Distortion Region"2016
Completing Low-Rank Matrices With Corrupted Samples From Few Coefficients in General Basis2016
Compression for Quadratic Similarity Queries: Finite Blocklength and Practical Schemes2016
Computation in Multicast Networks: Function Alignment and Converse Theorems2016
Convolutional Codes With Maximum Column Sum Rank for Network Streaming2016
Cooperative Binning for Semideterministic Channels2016
Decode-and-Forward Relaying via Standard AWGN Coding and Decoding2016
Degrees of Freedom of Uplink-Downlink Multiantenna Cellular Networks2016
Dictionary Learning With Few Samples and Matrix Concentration2016
Diffusion-Based Adaptive Distributed Detection: Steady-State Performance in the Slow Adaptation Regime2016
Dissipation of Information in Channels With Input Constraints2016
Distortion Exponent in MIMO Fading Channels With Time-Varying Source Side Information2016
Distortion Rate Function of Sub-Nyquist Sampled Gaussian Sources2016
Distributed Function Computation Over a Rooted Directed Tree2016
Duality of a Source Coding Problem and the Semi-Deterministic Broadcast Channel With Rate-Limited Cooperation2016
Efficient Algorithms for the Data Exchange Problem2016
Efficient Approximation of Quantum Channel Capacities2016
Efficient Non-Malleable Codes and Key Derivation for Poly-Size Tampering Circuits2016
Entropy and Source Coding for Integer-Dimensional Singular Random Variables2016
Equiangular Tight Frames From Hyperovals2016
Erasure/List Random Coding Error Exponents Are Not Universally Achievable2016
Estimating Renyi Entropy of Discrete Distributions2016
Estimating the Directed Information and Testing for Causality.2016
Exact Recovery in the Stochastic Block Model2016
Excess-Risk of Distributed Stochastic Learners2016
Finding a Sparse Vector in a Subspace: Linear Sparsity Using Alternating Directions2016
Finite-Length Analysis of Caching-Aided Coded Multicasting2016
Finite-Length Analysis of Caching-Aided Coded Multicasting.2016
Fixed Points of Generalized Approximate Message Passing With Arbitrary Matrices2016
Fixed Points of Generalized Approximate Message Passing With Arbitrary Matrices.2016
Folding Alternant and Goppa Codes With Non-Trivial Automorphism Groups2016
Fractional Repetition Codes With Flexible Repair From Combinatorial Designs2016
From Denoising to Compressed Sensing2016
Fundamental Limits of Communication With Low Probability of Detection2016
Gaussian Multiple Access via Compute-and-Forward2016
Generalized Independent Component Analysis Over Finite Alphabets2016
Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels2016
Global and Local Information in Clustering Labeled Block Models2016
Group-Sparse Model Selection: Hardness and Relaxations2016
Group-Sparse Model Selection: Hardness and Relaxations.2016
Guaranteed Matrix Completion via Non-Convex Factorization2016
Hierarchical Coded Caching2016
Identification Rate, Search and Memory Complexity Tradeoff: Fundamental Limits2016
Information Exchange and Learning Dynamics Over Weakly Connected Adaptive Networks2016
Information Recovery From Pairwise Measurements2016
Information-Theoretic Caching: Sequential Coding for Computing2016

« prev Page 35/80 next »