An efficient length- and rate-preserving concatenation of polar and repetition codes

Abstract

We improve the method in [1] for increasing the finite-lengh performance of polar codes by protecting specific, less reliable symbols with simple outer repetition codes. Decoding of the scheme integrates easily in the known successive decoding algorithms for polar codes. Overall rate and block length remain unchanged, the decoding complexity is at most doubled. A comparison to related methods for performance improvement of polar codes is drawn.

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@article{Seidl2013AnEL, title={An efficient length- and rate-preserving concatenation of polar and repetition codes}, author={Mathis Seidl and Johannes B. Huber}, journal={CoRR}, year={2013}, volume={abs/1312.2785} }