Chained Polar Subcodes

Conference: SCC 2017 - 11th International ITG Conference on Systems, Communications and Coding
02/06/2017 - 02/09/2017 at Hamburg, Germany

Proceedings: ITG-Fb. 268: SCC 2017

Pages: 6Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Authors:
Trifonov, Peter (Saint Petersburg Polytechnic University, Russia)

Abstract:
A generalization of polar codes is proposed, which makes use of a number of polarizing transformations of different size. This enables one to obtain arbitrary code length and prescribed minimum distance. Generalizations of the successive cancellation algorithm and its list extension to the case of the proposed codes are presented.