Abstract

This paper presents a general and three specific algebraic methods for constructing efficiently encodable non-binary quasi-cyclic LDPC codes. Three classes of quasi-cyclic LDPC codes over nonbinary finite fields are constructed. codes constructed perform very well over the AWGN channel with iterative decoding and achieve large coding gains over the Reed-Solomon codes of the same parameters. Nonbinary LDPC codes may be used to replace Reed-Solomon codes in some communication environments or storage systems for combating mixed types of noises and interferences.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call