Polar Codes for the Deletion Channel: Weak and Strong Polarization

Journal Article

This paper presents the first proof of polarization for the deletion channel with a constant deletion rate and a regular hidden-Markov input distribution. A key part of this work involves representing the deletion channel using a trellis and describing the plus and minus polar-decoding operations on this trellis. In particular, the plus and minus operations can be seen as combining adjacent trellis stages to yield a new trellis with half as many stages. Using this viewpoint, we prove a weak polarization theorem for standard polar codes on the deletion channel. To achieve strong polarization, we modify this scheme by adding guard bands of repeated zeros between various parts of the codeword. Using this approach, we obtain a scheme whose rate approaches the mutual information and whose probability of error decays exponentially in the cube-root of the block length.

Full Text

Duke Authors

Cited Authors

  • Tal, I; Pfister, HD; Fazeli, A; Vardy, A

Published Date

  • July 1, 2019

Published In

Volume / Issue

  • 2019-July /

Start / End Page

  • 1362 - 1366

International Standard Serial Number (ISSN)

  • 2157-8095

Digital Object Identifier (DOI)

  • 10.1109/ISIT.2019.8849705

Citation Source

  • Scopus