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
Universal lossless compression via multilevel pattern matching2000
A generalization of algebraic-geometry codes1999
A Multifractal Wavelet Model with Application to Network Traffic1999
Analysis of Multiscale Products for Step Detection and Estimation1999
Asymptotic performance of vector quantizers with a perceptual distortion measure1999
Asymptotic theory of greedy approximations to minimal k-point random graphs1999
Combined Array Processing and Space-Time Coding1999
Constructions of Algebraic-Geometry Codes1999
Design of successively refinable trellis-coded quantizers1999
Efficient encoding for a class of subspace subcodes1999
Entropy Computations via Analytic Depoissonization1999
Filterbank Transceivers Optimizing Information Rate in Block Transmissions over Dispersive Channels1999
Improved Rates and Asymptotic Normality for Nonparametric Neural Network Estimators1999
Information Measures in Scale-Spaces1999
Interpolation by convolutional codes, overload distortion, and the erasure channel1999
Introduction to Special Issue on Mutliscale Statistical Signal Analysis and Its Application1999
Linear Multiuser Receivers: Effective Interference, Effective Bandwidth and User Capacity1999
Local Asymptotic Coding and the Minimum Description Length1999
Maximum Entropy and Robust Prediction on a Simplex1999
MEM pixel correlated solutions for generalized moment and interpolation problems1999
Minimax description length for signal denoising and optimized representation1999
Minimax Emission Computed Tomography using High-Resolution Anatomical Side Information and B-Spline Models1999
Multiscale Modeling and Estimation of Poisson Processes with Application to Photon-Limited Imaging1999
Noise Conditions for Prespecified Convergence Rates of Stochastic Approximation Algorithms1999
On denoising and best signal representation1999
On minimum Lee weights of Hensel lifts of some binary BCH codes1999
On the Redundancy of Lossy Source Coding with Abstract Alphabets1999
Optimal sequences and sum capacity of synchronous CDMA systems1999
Optimal sequences, power control, and user capacity of synchronous CDMA systems with linear MMSE multiuser receivers1999
Performance limits of coded diversity methods for transmitter antenna arrays1999
Quantization based on a novel sample-adaptive product quantizer (SAPQ)1999
Sequences with Almost Perfect Linear Complexity Profiles and Curves Over Finite Fields1999
Several classes of binary sequences with three-level autocorrelation1999
Shaping and nonequiprobable signaling for intensity-modulated signals1999
Space-Time block codes from orthogonal designs1999
Spatially correlated qubit errors and burst-correcting quantum codes1999
Structured Prefix Codes for Quantized Low-Shape-Parameter Generalized Gaussian Sources1999
The shortest common superstring problem: Average case analysis for both exact and approximate matching1999
Universal Bound on the Performance of Lattice Codes1999
Variable-Rate Trellis Source Encoding1999
1997 Information Theory Society Paper Award1998
A Decision-Theoretic Extension of Stochastic Complexity and Its Applications to Learning1998
Algebraic-Geometry Codes1998
A modified concatenated coding scheme, with applications to magnetic data storage1998
An On-Line Universal Lossy Data Compression Algorithm via Continuous Codebook Refinement - Part III: Redundancy Analysis1998
Asymptotic multiuser efficiencies for decision-directed multiuser detectors1998
Bandwidth-Efficient Coded Modulation with Optimized Linear Partial-Response Signals1998
Binary Constant-Weight Codes for Error Detection1998
Blind Multiuser Detection: A Subspace Approach1998
Capacity of Two-Layer Feedforward Neural Networks with Binary Weights1998

« prev Page 75/80 next »