Algebraic Construction of Quasi-cyclic LDPC Codes -Part II For AWGN and Binary Random and Burst Erasure Channels

This paper is the second part of a sequence of two papers that present several algebraic methods for constructing quasi-cyclic (QC) LDPC codes for AWGN, binary random and burst erasure channels. In the first paper, we presented a class of QC-LDPC codes for both the AWGN and binary random erasure channels. The construction of this class of QC-LDPC codes is based on finite fields and location vector representations of finite field elements. In this paper, we presented two other algebraic methods for constructing QC-LDPC codes for the AWGN, binary random and burst erasure channels.