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.
Top Authors
Impactful Papers
Papers from this venue that shaped research clusters.
Foundational
On the Capacity of Deletion Channels with States
foundational
Capacity Convergence of Markov Approxima
2020
Statistical mechanical evaluation of error exponents for lossy data compression
foundational
Non-Monotonic Activation Functions for B
2004
On the correlation between Boolean functions of sequences of random variables
foundational
Bounding Output Correlation via the Depe
2017
On the Correlation between Boolean Functions of Sequences of Random Variables
foundational
Bounding Output Correlation via the Depe
2017
Privacy Leakage in Discrete-Time Updating Systems
foundational
Balancing Information Freshness and Priv
2022
An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes
foundational
Private Information Retrieval over Non-M
2018
Compression for Qubit Clocks
foundational
Hierarchical Compression of Quantum Stat
2018
Redundancy allocation of partitioned linear block codes
foundational
Partitioning Redundancy for Defect Maski
2013
Statistical mechanical evaluation of error exponents for lossy data compression
foundational
Breaking Symmetry in Belief Propagation
2004
Universally Decodable Matrices for Distributed Matrix-Vector Multiplication
foundational
Numerical Stability in Coded Distributed
2019
Influential
A semidefinite programming upper bound of quantum capacity
influential
One Shot Capacity Bounds for Quantum Cha
2016
Unlimited Sampling of Sparse Sinusoidal Mixtures
influential
Exact Signal Inversion via Finite Differ
2018
Optimal Streaming Erasure Codes Over the Three-Node Relay Network
influential
Streaming Codes for Low Latency Communic
2019
The missing piece syndrome in peer-to-peer communication
influential
The Missing Piece Syndrome in Peer to Pe
2010
Fundamental tradeoff between computation and communication in distributed computing
influential
Reducing Communication Overhead in Distr
2016
Partial Information Decomposition via Deficiency for Multivariate Gaussians
influential
Scaling Multivariate Information Decompo
2022
A semidefinite programming upper bound of quantum capacity
influential
The Intractability of Multi-Letter Chann
2016
Sample complexity of the boolean multireference alignment problem
influential
Beyond the High SNR Asymptotic Assumptio
2017
Sketching and Sequence Alignment: A Rate-Distortion Perspective
influential
Overcoming the Quadratic Bottleneck in S
2021
Related Venues
Venues with the most similar research cluster distributions.
IEEE Trans. Information Theory77% similar · 3,965 papers
Itw57% similar · 711 papers
Allerton41% similar · 1,172 papers
IEEE Communications Letters31% similar · 1,592 papers
GLOBECOM31% similar · 4,517 papers
IEEE Trans. Communications30% similar · 2,513 papers
IEEE J. Sel. Areas Inf. Theory28% similar · 209 papers
IEEE JSAC27% similar · 2,163 papers
Isita27% similar · 91 papers
ICC27% similar · 4,692 papers