Quasi-cyclic LDPC codes on two arbitrary sets of a finite field
Juane Li, Keke Liu, Shu Lin, Khaled Abdel Ghaffar · 2014
This paper presents a simple and flexible method for constructing QC-LDPC codes based on two arbitrary sets of a finite field. Based on this method, a high-rate, high-performance and very low error-floor QC-LDPC code is first constructed and then a class of rate-1/2 QC-LDPC codes whose Tanner graphs have girth 8 or larger is presented. Also presented is a reduced-complexity iterative decoding algorithm for QC-LDPC codes.