Multiplicatively Repeated Nonbinary LDPC Codes
In 1963, Gallager invented low-Density Parity-Check (LDPC) codes. Due to sparsity of the code representation, LDPC codes are efficiently decoded by Belief Propagation (BP) decoders. By a powerful optimization method density evolution, developed by Richardson and Urbanke, messages of BP decoding can be statistically evaluated. The optimized LDPC codes can approach very close to Shannon limit. Moreover, the authors propose the decoding algorithm for the proposed codes, which can be decoded with almost the same computational complexity as that of the mother code.