ISIT

4,200 papers942 directions
ISIT is a research venue focused on the mathematical foundations of information theory, communication, and coding. Since 2004, it has published over 4,000 papers covering topics such as capacity-achieving codes, polynomial-time decoding, and finite blocklength theory for low-latency communications. The venue serves as a primary forum for research into error-correcting codes, message passing via density evolution, and the generalization of information theory to continuous alphabets. In the context of machine learning and artificial intelligence, ISIT explores the theoretical limits of statistical estimation, distributed computing, and data representation. Recent research directions include coded computing for resilient distributed learning, score-based manifold projection for diffusion models, and the use of Wasserstein distances in robust quantization. The venue features contributions from prolific researchers such as Vincent Y. F. Tan, Tsachy Weissman, and H. Vincent Poor, who bridge the gap between classical information theory and modern computational challenges. The venue’s technical scope also extends to specialized areas like classical shadow tomography, matrix multiplication via nested-lattice quantization, and statistical estimation under correlated noise. By focusing on the intersection of f-divergence, statistical inference, and communication constraints, ISIT provides a rigorous framework for understanding the fundamental trade-offs in data processing and algorithmic efficiency.

Papers by Year

2026 106
2025 158
2024 206
2023 166
2022 204
2021 215
2020 203
2019 230
2018 230
2017 255
2016 253
2015 251
2014 238
2013 217
2012 211
2011 183
2010 178
2009 168
2008 127
2007 136
2006 118
2005 91
2004 103

Top Research Directions

Research directions most represented by papers from this venue.

The Empirical Validation Gap 22
Optimizing Repair Bandwidth for Distributed Erasure Codes 17
From Non-Constructive Existence to Explicit Code Constructions 17
Threshold Saturation via Spatially Coupled Codes 15
The Intractability of Multi-Letter Channel Capacities 15
Overcoming Idealized Assumptions in Channel Modeling 14
Communication with Asymmetric Channel State Information 13
Information Theory for Short Packet Wireless Communications 13
Straggler-Resilient Coded Computation 13
Beyond the High SNR Asymptotic Assumption 12
Compress and Forward Relaying with Side Information 12
Generalizing Information Theory to Continuous Alphabets 12
The Statistical Computational Gap in High Dimensions 12
The Scalability Bottleneck of Multi User Interference Management 12
Channel Symmetrizability in Adversarial Communication 11

Top Authors

AuthorPapers
Tsachy Weissman85
Deniz Gunduz70
Vincent Y. F. Tan69
Christina Fragouli67
Yury Polyanskiy58
Antonia Wachter-Zeh53
Ashish J Khisti51
Pablo Piantanida50
Ayfer Ozgur48
Chao Tian47
H. Vincent Poor41
Ravi Tandon37
Oliver Kosut36
Anant Sahai35
Mehul Motani35
Alfred O. Hero33
Farzad Farnoud33
Flavio Calmon32
Jun Chen32
Salman Avestimehr32

Impactful Papers

Papers from this venue that shaped research clusters.

Foundational

Influential

Related Venues

Venues with the most similar research cluster distributions.

Papers

TitleYear
Maximum a posteriori decoding and turbo codes for general memoryless channels2005
Maximum weight matching via max-product belief propagation2005
Minimum estimation and combining generalized selection combining (MEC-GSC)2005
More on reconstructing strings from random traces: insertions and deletions2005
Most balanced overload response in sensor networks2005
Multi-directional context sets with applications to universal denoising and compression2005
Multi-tone FSK with feedback2005
Myopic coding in multiple relay channels2005
Network monitoring in multicast networks using network coding2005
New coding strategies for the relay channel2005
New quaternary low correlation zone sequences2005
Neyman-Pearson Detection of Gauss-Markov Signals in Noise: Closed-Form Error Exponent and Properties2005
Non prefix-free codes for constrained sequences2005
On an upper bound of the secrecy capacity for a general wiretap channel2005
On average throughput and alphabet size in network coding2005
One-to-one code and its anti-redundancy2005
On sensor network lifetime and data distortion2005
On the complexity of joint source-channel decoding of markov sequences over memoryless channels2005
On the minimal pseudo-codewords of codes from finite geometries2005
On the overhead-delay tradeoff in carrier sense collision channels2005
On the performance of turbo codes in quasi-static fading channels2005
On the pointwise redundancy of the LZ78 algorithm2005
On the relationship between process and pattern entropy rate2005
On the spread of random interleavers2005
On the throughput improvement due to limited complexity processing at relay nodes2005
Optimal linear decentralized estimation in a bandwidth constrained sensor network2005
Optimizing end-to-end distortion in MIMO systems2005
Outage-optimal relaying in the low SNR regime2005
Properties of Kullback-Leibler cross-entropy minimization in nonextensive framework2005
Rainbow network problems and multiple description coding2005
Rate-constrained relaying: achievable rates and protocol comparisons2005
Rateless coding for wireless relay channels2005
Rateless space-time coding2005
Relative entropy and exponential deviation bounds for general Markov chains2005
Sequential random binning for streaming distributed source coding2005
Serial distributed detection for wireless sensor networks2005
Spectral factorization, whitening- and estimation filter - stability, smoothness properties and FIR approximation behavior2005
Spectral Factorization, Whitening- and Estimation Filter -- Stability, Smoothness Properties and FIR Approximation Behavior2005
String matching-based universal source codes for source networks with asymptotically zero feedback2005
Structure of replica-symmetric solutions for randomly-spread CDMA2005
The capacity region of multiple input erasure broadcast channels2005
The infeasible SIR region is not a convex set2005
Throughput-delay scaling in wireless networks with constant-size packets2005
Throughput optimal control of cooperative relay networks2005
Ultra-wideband channel modeling on the basis of information-theoretic criteria2005
Universal estimation of divergence for continuous distributions via data-dependent partitions2005
When to synchronize in uplink CDMA2005
Achievable rates for multiple-access channels with correlated messages2004
Achieving the perfect secrecy for the Gaussian wiretap channel with side information2004
A comparison of network coding and tree packing2004

« prev Page 82/84 next »