Tight lower bound of consecutive lengths for QC-LDPC codes with girth twelve

Details Tight lower bound of consecutive lengths for QC-LDPC codes with girth twelve Tight lower bound of consecutive lengths for QC-LDPC codes with girth twelve

2012-04-22

arxiv.org/abs/1204.4864v1

Computer Science

Information Theory

9 pages,1 figure. the chinese version of this paper has been published in Chinese Sci Bull,2011, 56 (19):1578-1582

Scientific paper

For an arbitrary (3,L) QC-LDPC code with a girth of twelve, a tight lower bound of the consecutive lengths is proposed. For an arbitrary length above the bound the resultant code necessarily has a girth of twelve, and for the length meeting the bound, the corresponding code inevitably has a girth smaller than twelve. The conclusion can play an important role in the proofs of the existence of large-girth QC-LDPC codes, the construction of large-girth QC-LDPC codes based on the Chinese remainder theorem, and the construction of LDPC codes with the guaranteed error correction capability.

Affiliated with

Also associated with

No associations

Rating

Tight lower bound of consecutive lengths for QC-LDPC codes with girth twelve 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 Tight lower bound of consecutive lengths for QC-LDPC codes with girth twelve, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tight lower bound of consecutive lengths for QC-LDPC codes with girth twelve will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522736