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

Mathis Seidl, Johannes B. Huber

We improve the method in \cite{Seidl:10} 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.

Knowledge Graph



Sign up or login to leave a comment