Multiplicatively Repeated Non-Binary LDPC Codes
Information Theory
2011-07-14 v2 math.IT
Abstract
We propose non-binary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular non-binary LDPC mother code of rate 1/3, we construct rate-compatible codes of lower rates 1/6, 1/9, 1/12,... Surprisingly, such simple low-rate non-binary LDPC codes outperform the best low-rate binary LDPC codes so far. Moreover, we propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.
Cite
@article{arxiv.1004.5367,
title = {Multiplicatively Repeated Non-Binary LDPC Codes},
author = {Kenta Kasai and David Declercq and Charly Poulliat and Kohichi Sakaniwa},
journal= {arXiv preprint arXiv:1004.5367},
year = {2011}
}
Comments
To appear in IEEE Transactions on Information Theory