An Explicit Method To Generate Girth-6 LDPC codes

In this paper‎, ‎a new explicit method for constructing 3* L exponent matrices which correspond to Tanner graph with girth 6‎, ‎is proposed‎. ‎For each 3* L exponent matrix E, ‎we say Q(E) is the lower-bound if for each p >= Q(E), ‎all (3,L) QC LDPC codes with exponent matrix E and block-size p have girth at least 6‎. ‎As an advantage‎, ‎the exponent matrices proposed in this paper have better lower-bound rather than the best known ones corresponding to explicitly constructed (3,L) QC LDPC codes with girth 6‎. ‎

Low-density parity-check codes‎, ‎girth‎, ‎exponent matrix‎, ‎explicit method