Construction of Quasi-Cyclic LDPC Codes From Prime Fields
基于素域构造的准循环低密度校验码

This paper presents a method to construct quasi-cyclic LDPC codes from prime fields. This method is a generalization of a method proposed by Lan et al to construct quasi-cyclic LDPC codes based on finite fields, and gives a much larger class of quasi-cyclic LDPC codes based on prime fields. Simulations show that quasi-cyclic LDPC codes constructed by the proposed method perform well over AWGN channels with iterative decoding.