An Overview of Capacity Results for Synchronization Channels
Mahdi Cheraghchi, Jo\~ao Ribeiro

TL;DR
This paper surveys the extensive research efforts over decades to understand the capacity of synchronization channels, highlighting the challenges, key results, and novel techniques in analyzing these complex communication models.
Contribution
It provides a comprehensive overview of the main results and methods developed for determining the capacity of synchronization channels, including zero-error capacity.
Findings
Summarizes key capacity bounds for synchronization channels.
Discusses novel analytical techniques for these channels.
Highlights open problems and future research directions.
Abstract
Synchronization channels, such as the well-known deletion channel, are surprisingly harder to analyze than memoryless channels, and they are a source of many fundamental problems in information theory and theoretical computer science. One of the most basic open problems regarding synchronization channels is the derivation of an exact expression for their capacity. Unfortunately, most of the classic information-theoretic techniques at our disposal fail spectacularly when applied to synchronization channels. Therefore, new approaches must be considered to tackle this problem. This survey gives an account of the great effort made over the past few decades to better understand the (broadly defined) capacity of synchronization channels, including both the main results and the novel techniques underlying them. Besides the usual notion of channel capacity, we also discuss the zero-error…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDNA and Biological Computing · Cellular Automata and Applications · Quantum Computing Algorithms and Architecture
