Construction of Quasi-Cyclic LDPC Codes Basedon the Primitive Elements of Finite Fields

摘要

This paper presents an algebraic method for constructingrnquasic-cyclic LDPC codes based on the primitive elementsrnof finite fields. The construction gives a class of efficientlyrnencodable quasi-cyclic LDPC codes. Experimental results showrnthat the constructed codes decoded with iterative decodingrnusing the sum-product algorithm perform well over the AWGNrnchannel.