2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | S.4.4 | ||
| Paper Title | On the Capacity of Deletion Channels with States | ||
| Authors | Yonglong Li, Vincent, Y. F. Tan, National University of Singapore, Singapore | ||
| Session | S.4: Channels with State | ||
| Presentation | Lecture | ||
| Track | Shannon Theory | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | In this paper we consider a channel formed from the concatenation of a deletion channel and a finite-state channel. For this class of channels, we show that the operational capacity is equal to the stationary capacity, which can be approached by a sequence of Markov processes with increasing Markovian orders. As a by-product, we show that the coding scheme constructed by Tal, Pfister, Fazeli, and Vardy [arxiv: 1904.13385 (2019)] achieves the capacity of the deletion channel. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
