Polar Coding for the Binary Erasure Channel With Deletions

We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a list decoding algorithm with a cyclic redundancy check for this case. The decoding complexity is <inline-formula> <tex-math notation="LaTeX">$O(N^{2}\log N)$ </tex-math></inline-formula>, where <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> is the blocklength of the code. An important contribution is an optimization of the amount of redundancy added to minimize the overall error probability. Our theoretical results are corroborated by numerical simulations, which show that the list size can be reduced to one and the original message can be recovered with high probability as the length of the code grows.

[1]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[2]  Kannan Ramchandran,et al.  Achievable rates for channels with deletions and insertions , 2011, ISIT.

[3]  Toshiyuki Tanaka,et al.  Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization , 2011, IEEE Transactions on Information Theory.

[4]  Yi Hong,et al.  Efficient Algorithms for Systematic Polar Encoding , 2016, IEEE Communications Letters.

[5]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[6]  Emmanuel Abbe,et al.  Polar coding schemes for the AWGN channel , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[8]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[9]  Lara Dolecek,et al.  Using Reed–Muller ${\hbox{RM}}\,(1, m)$ Codes Over Channels With Synchronization and Substitution Errors , 2007, IEEE Transactions on Information Theory.

[10]  Philip Koopman,et al.  Cyclic redundancy code (CRC) polynomial selection for embedded networks , 2004, International Conference on Dependable Systems and Networks, 2004.

[11]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[12]  Rüdiger L. Urbanke,et al.  Finite-Length Scaling for Polar Codes , 2013, IEEE Transactions on Information Theory.

[13]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.

[14]  Kai Chen,et al.  CRC-Aided Decoding of Polar Codes , 2012, IEEE Communications Letters.

[15]  John T. Coffey,et al.  On the capacity of a cascade of channels , 1993, IEEE Trans. Inf. Theory.

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

[17]  Suhas N. Diggavi,et al.  Capacity Upper Bounds for the Deletion Channel , 2007, 2007 IEEE International Symposium on Information Theory.