|| Polar Codes for Channels with Insertions, Deletions, and Substitutions
||Henry Pfister, Duke University, United States; Ido Tal, Technion, United States|
||D6-S2-T2: Polar Codes IV
||Monday, 19 July, 22:20 - 22:40
||Monday, 19 July, 22:40 - 23:00
This paper presents a coding scheme for an insertion deletion substitution channel. We extend a previous scheme for the deletion channel where polar codes are modified by adding ``guard bands'' between segments. In the new scheme, each guard band is comprised of a middle segment of `1' symbols, and left and right segments of `0' symbols. Our coding scheme allows for a regular hidden-Markov input distribution, and achieves the information rate between the input and corresponding output of such a distribution. Thus, we prove that our scheme can be used to efficiently achieve the capacity of the channel. The probability of error of our scheme decays exponentially in the cube-root of the block length.