Polar Subcodes

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 cl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE journal on selected areas in communications 2016-02, Vol.34 (2), p.254-266
Hauptverfasser:	Trifonov, Peter, Miloslavskaya, Vera
Format:	Artikel
Sprache:	eng
Schlagworte:	BCH codes Block codes Cancellation Concatenated codes Decoding Dynamics Error correcting codes Error probability Freezing Frozen generalized concatenated codes Generators Kernel Kernels Polar codes Reed-Solomon codes Symbols
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0733-8716 1558-0008
DOI:	10.1109/JSAC.2015.2504269