Abstract
Recently, non-bibary LDPC codes over GF(2^m) attract much attention. Despite the considerable potential for error correction, non-binary LDPC codes suffer from huge decoding complexity and memory requirement. This report briefly reviews design and decoding schemes of non-binary LDPC codes.
