Successive Cancellation Decoding of Single Parity-Check Product Codes
Information Theory
2017-06-19 v1 math.IT
Abstract
We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC decoding algorithm of polar codes. We analyze the error probability of SPC-PCs over the binary erasure channel under SC decoding. A bridge with the analysis of PCs introduced by Elias in 1954 is also established. Furthermore, bounds on the block error probability under SC decoding are provided, and compared to the bounds under the original decoding algorithm proposed by Elias. It is shown that SC decoding of SPC-PCs achieves a lower block error probability than Elias' decoding.
Keywords
Cite
@article{arxiv.1706.05238,
title = {Successive Cancellation Decoding of Single Parity-Check Product Codes},
author = {Mustafa Cemil Coşkun and Gianluigi Liva and Alexandre Graell i Amat and Michael Lentmaier},
journal= {arXiv preprint arXiv:1706.05238},
year = {2017}
}