A Randomized Construction of Polar Subcodes
Information Theory
2017-05-04 v2 math.IT
Abstract
A method for construction of polar subcodes is presented, which aims on minimization of the number of low-weight codewords in the obtained codes, as well as on improved performance under list or sequential decoding. Simulation results are provided, which show that the obtained codes outperform LDPC and turbo codes.
Cite
@article{arxiv.1705.00202,
title = {A Randomized Construction of Polar Subcodes},
author = {Peter Trifonov and Grigorii Trofimiuk},
journal= {arXiv preprint arXiv:1705.00202},
year = {2017}
}
Comments
Accepted to ISIT 2017 Formatting changes