Polar Subcodes
Information Theory
2016-11-17 v1 math.IT
Abstract
An extension of polar codes is proposed, which allows some of the frozen symbols, called dynamic frozen symbols, to be data-dependent. A construction of polar codes with dynamic frozen symbols, being subcodes of extended BCH codes, is proposed. The proposed codes have higher minimum distance than classical polar codes, but still can be efficiently decoded using the successive cancellation algorithm and its extensions. The codes with Arikan, extended BCH and Reed-Solomon kernel are considered. The proposed codes are shown to outperform LDPC and turbo codes, as well as polar codes with CRC.
Keywords
Cite
@article{arxiv.1511.01646,
title = {Polar Subcodes},
author = {Peter Trifonov and Vera Miloslavskaya},
journal= {arXiv preprint arXiv:1511.01646},
year = {2016}
}
Comments
Accepted to IEEE JSAC special issue on Recent Advances In Capacity Approaching Codes