|On the Capacity of Deletion Channels with States
|Yonglong Li, Vincent, Y. F. Tan, National University of Singapore, Singapore
|S.4: Channels with State
|Click here to download the manuscript
|Click here to watch in the Virtual Symposium
|In this paper we consider a channel formed from the concatenation of a deletion channel and a ﬁnite-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, Pﬁster, Fazeli, and Vardy [arxiv: 1904.13385 (2019)] achieves the capacity of the deletion channel.