Multiplicatively Repeated Non-Binary LDPC Codes
Kasai, Kenta ; Declercq, David ; Poulliat, Charly ; Sakaniwa, Kohichi
HAL, hal-00764119 / Harvested from HAL
Text on HAL
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.
Publié le : 2011-10-05
Classification:  [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT],  [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT] 
@article{hal-00764119,
     author = {Kasai, Kenta and Declercq, David and Poulliat, Charly and Sakaniwa, Kohichi},
     title = {Multiplicatively Repeated Non-Binary LDPC Codes},
     journal = {HAL},
     volume = {2011},
     number = {0},
     year = {2011},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00764119}
}

Kasai, Kenta; Declercq, David; Poulliat, Charly; Sakaniwa, Kohichi. Multiplicatively Repeated Non-Binary LDPC Codes. HAL, Tome 2011 (2011) no. 0, . http://gdmltest.u-ga.fr/item/hal-00764119/