Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes

摘要：

In the late 1950s and early 1960s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for correcting random errors with algebraic decoding, such as Bose-Chaudhuri-Hocqenghem (BCH) and Reed-Solomon (RS) codes. Recently it has been shown that finite fields can also be used successfully to construct binary quasi-cyclic (QC)-LDPC codes that perform very well not only over the AWGN channel but also over the binary erasure channel with iterative decoding, besides being efficiently encodable. This paper is concerned with constructions of nonbinary QC-LDPC codes based on finite fields.

作者: Shu Lin Shumei Song Ying Y.Tai Lan Lan Lingqi Zeng

作者单位: Department of Electrical & Computer Engineering University of California, Davis Davis, CA 95616

会议类型: 国际会议

会议名称: 2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)

会议地点: 广西桂林

会议语种:英文

页码: 1303-1308

在线出版日期: 2006-06-25（万方平台首次上网日期，不代表论文的发表时间）