Multiplicatively Repeated Nonbinary LDPC Codes

DOI10.1109/TIT.2011.2162259MaRDI QIDQ5272304zbMATH OpenFDO

Authors Kenta Kasai, David Declercq, Charly Poulliat, Kohichi Sakaniwa

Publication date 12 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.5367

Mathematics Subject Classification ID

Majority codes (94B30) Decoding (94B35)

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.

This page was built for publication: Multiplicatively Repeated Nonbinary LDPC Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5272304)