Construction of multiple-rate quasi-cyclic LDPC codes with girth eight
This paper proposes a new approach to construct quasi-cyclic low-density parity-check (QC-LDPC) codes of girth 8. The proposed codes are based on a bipartite graph called Moore graph. By decomposing the bit nodes of the bipartite graph, the proposed QC-LDPC codes have variable code lengths and rates. Simulation results show that the proposed QC-LDPC codes have good performance with an iterative decoding over an AWGN channel.