Polar Codes for Channels with Insertions, Deletions, and Substitutions

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.

[1]  Rongke Liu,et al.  Polar codes for channels with deletions , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Alexander Vardy,et al.  Polar Coding for the Binary Erasure Channel With Deletions , 2017, IEEE Communications Letters.

[3]  Mahdi Cheraghchi.  Capacity upper bounds for deletion-type channels , 2018, STOC.

[4]  Arman Fazeli,et al.  Polar Coding for Deletion Channels: Theory and Implementation , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[5]  R. Gallager.  SEQUENTIAL DECODING FOR BINARY CHANNELS WITH NOISE AND SYNCHRONIZATION ERRORS , 1961 .

[6]  Yashodhan Kanoria,et al.  Optimal Coding for the Binary Deletion Channel With Small Deletion Probability , 2013, IEEE Transactions on Information Theory.

[7]  Ido Tal,et al.  Fast Polarization for Processes with Memory , 2017, 2018 IEEE International Symposium on Information Theory (ISIT).

[8]  Ido Tal,et al.  Polar coding for processes with memory , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[9]  Tolga M. Duman,et al.  Upper Bounds on the Capacity of Deletion Channels Using Channel Fragmentation , 2015, IEEE Transactions on Information Theory.

[10]  Ido Tal,et al.  Universal Polarization for Processes with Memory , 2018, 2019 IEEE International Symposium on Information Theory (ISIT).

[11]  Aleksandar Kavcic,et al.  Trellis based lower bounds on capacities of channels with synchronization errors , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

[12]  Vincent Y. F. Tan,et al.  On the Capacity of Channels With Deletions and States , 2019, IEEE Transactions on Information Theory.

[13]  Rongke Liu,et al.  Joint Successive Cancellation Decoding of Polar Codes over Intersymbol Interference Channels , 2014, ArXiv.

[14]  Haruhiko Kaneko,et al.  Successive Cancellation Decoding of Polar Codes for Insertion/Deletion Error Correction , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[15]  Rongke Liu,et al.  Construction of polar codes for channels with memory , 2015, 2015 IEEE Information Theory Workshop - Fall (ITW).

[16]  David J. C. MacKay,et al.  Reliable communication over channels with insertions, deletions, and substitutions , 2001, IEEE Trans. Inf. Theory.

[17]  Arman Fazeli,et al.  Polar Codes for the Deletion Channel: Weak and Strong Polarization , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[18]  Michael Mitzenmacher,et al.  A Survey of Results for Deletion Channels and Related Synchronization Channels , 2008, SWAT.

[19]  David J. C. MacKay,et al.  Codes for Channels with Insertions, Deletions and Substitutions , 2000 .