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

Abstract

This paper presents an algebraic method for constructing quasi-cyclic LDPC codes based on the primitive elements of finite fields. The construction gives a class of efficiently encodable quasi-cyclic LDPC codes. Experimental results show that the constructed codes decoded with iterative decoding using the sum-product algorithm perform well over the AWGN channel.