Two classes of QC-LDPC cycle codes approaching Gallager lower bound

• 来源期刊: 中国科学:化学（英文版）
• 年，卷（期）: 2019,（10）
• 页码范围: 213-215
• 页数: 3页
• 语种: 英文

摘要

Dear editor, Many research results show that,for equivalent bit length,short nonbinary LDPC codes outperform binary LDPC codes by about 1 dB [1-3].Moreover,nonbinary LDPC codes have lower errorfloor,fast iterative decoding convergence,and strong ability of correcting burst errors.But the roadblock to their application is the high decoding complexity.Recently,significant studies on the low-complexity decoding algorithms of nonbinary LDPC codes have been done [4].It is noticeable that these low-complexity algorithms are under the frame of iterative decoding.Hence,it is interesting to design nonbinary LDPC codes with large minimum distance and suitable for the iterative algorithms.