Rate-compatible non-binary LDPC codes concatenated with multiplicative repetition codes
Kenta Kasai, David Declercq, Charly Poulliat, Kohichi Sakaniwa
Abstract
Kenta Kasai, David Declercq, Charly Poulliat, Kohichi Sakaniwa
Abstract
We propose non-binary LDPC codes concatenated with multiplicative repetition codes. To the best of the authors' knowledge, for the transmissions over the memoryless binary-input output-symmetric channels, 2m-ary the (2,dc)-regular LDPC code for m ~ 8 and dc≥ 3 is the best code so far among codes with moderate code length. By multiplicatively repeating the 2m-ary (2,3)-regular LDPC code of rate 1/3, we construct rate-compatible codes of lower rates 1/6,1/9,1/12,.... Surprisingly, such simple low-rate codes outperform the best low-rate binary codes so far.
OpenAlex reports 14 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We propose non-binary LDPC codes concatenated with multiplicative repetition codes. To the best of the authors' knowledge, for the transmissions over the memoryless binary-input output-symmetric channels, 2m-ary the (2,dc)-regular LDPC code for m ~ 8 and dc≥ 3 is the best code so far among codes with moderate code length. By multiplicatively repeating the 2m-ary (2,3)-regular LDPC code of rate 1/3, we construct rate-compatible codes of lower rates 1/6,1/9,1/12,.... Surprisingly, such simple low-rate codes outperform the best low-rate binary codes so far.
Key concepts: Multiplicative function, Low-density parity-check code, Binary number, Code (set theory), Concatenated error correction code, Binary code, Discrete mathematics, Code rate