This paper presents three algebraic methods for constructing q-ary LDPC codes. The first method gives a class of dispersed Reed-Solomon codes as LDPC codes. The second method gives a class of q-ary quasi-cyclic LDPC codes. The third method gives two classes of q-ary finite geometry LDPC codes. Codes constructed by these methods perform very well with iterative decoding, even for short codes.
['Lingqi Zeng', 'Lan Lan', 'Ying Yu Tai', 'Shu Lin']
Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes