Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths

Details Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths

2010-01-22

arxiv.org/abs/1001.3916v1

Computer Science

Information Theory

5 pages, 4 figures

Scientific paper

A method to construct girth-12 (3,L) quasi-cyclic low-density parity-check (QC-LDPC) codes with all lengths larger than a certain given number is proposed, via a given girth-12 code subjected to some constraints. The lengths of these codes can be arbitrary integers of the form LP, provided that P is larger than a tight lower bound determined by the maximal element within the exponent matrix of the given girth-12 code. By applying the method to the case of row-weight six, we obtained a family of girth-12 (3,6) QC-LDPC codes for arbitrary lengths above 2688, which includes 30 member codes with shorter code lengths compared with the shortest girth-12 (3,6) QC-LDPC codes reported by O'Sullivan.

Affiliated with

Also associated with

No associations

Rating

Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Girth-12 Quasi-Cyclic LDPC Codes with Consecutive Lengths will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-655175