Design of Non-Binary Quasi-Cyclic LDPC Codes Based on Multiplicative Groups and Euclidean Geometries
This paper presents an approach to the construction of non-binary quasi-cyclic (QC) low-density parity-check (LDPC) codes based on multiplicative groups over one Galois field CF(q) and Euclidean geometries over another Galois field G F (2(s)). Codes of this class are shown to be regular with girth 6 <= g <= 18 and have low densities. Finally, simulation results show that the proposed codes perform very well with the iterative decoding.
multiplicative groups non-binary quasi-cyclic (qc) low-density parity-check (ldpc) codes girth eucliean geometry lines pointsv