Multiplicatively Repeated Non-Binary LDPC Codes

Kenta Kasai (1) , David Declercq (2) , Charly Poulliat (2) , Kohichi Sakaniwa (1)

1 TITECH - Tokyo Institute of Technology [Tokyo]
2 ETIS - UMR 8051 - Equipes Traitement de l'Information et Systèmes

We propose nonbinary LDPC codes concatenated with multiplicative repetition codes. By multiplicatively repeating the (2,3)-regular nonbinary LDPC mother code of rate 1/3, we con- struct rate-compatible codes of lower rates . Surprisingly, such simple low-rate nonbinary LDPC codes out- perform 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.

Domaines: Théorie de l'information [cs.IT]; Théorie de l'information et codage [math.IT]

Kenta Kasai, David Declercq, Charly Poulliat, Kohichi Sakaniwa. Multiplicatively Repeated Non-Binary LDPC Codes. IEEE Transactions on Information Theory, 2011, 57 (10), pp.6788-6795. ⟨hal-00764119⟩