On the Decoding Radius Realized by Low-Complexity Decoded Non-Binary Irregular LDPC Codes

Pavel S. Rybin, Alexey A. Frolov

Abstract: In this paper we consider the low complexity majority-logic decoding algorithm for irregular non-binary low-density parity-check (LDPC) codes. The decoding algorithm is a generalization of the bit-flipping algorithm for binary LDPC codes. The lower estimate on the decoding radius realized by this algorithm is derived for the first time for irregular non-binary LDPC codes. We present the numerical results for the derived lower bound.