Permutation Decoding of Polar Codes
Information Theory
2019-01-18 v1 math.IT
Abstract
A new permutation decoding approach for polar codes is presented. The complexity of the algorithm is similar to that of a successive cancellation list (SCL) decoder, while it can be implemented with the latency of a successive cancellation decoder. As opposed to the SCL algorithm, the sorting operation is not used in the proposed method. It is shown that the error correction performance of the algorithm is similar to that of the SCL decoder for polar codes. Moreover, a new construction aiming to improve the error correction performance of polar codes under the proposed algorithm is presented.
Keywords
Cite
@article{arxiv.1901.05459,
title = {Permutation Decoding of Polar Codes},
author = {Mikhail Kamenev and Yulia Kameneva and Oleg Kurmaev and Alexey Maevskiy},
journal= {arXiv preprint arXiv:1901.05459},
year = {2019}
}
Comments
arXiv admin note: text overlap with arXiv:1901.04433