Stronger Polarization for the Deletion Channel

Dar Arava, Ido Tal

In this paper we show a polar coding scheme for the deletion channel with a probability of error that decays roughly like $2^{-\sqrt{\hat{I}}›}$, where $\hat{I}›$ is the length of the codeword.…