1 research outputs found
Tight lower bound of consecutive lengths for QC-LDPC codes with girth twelve
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.Comment: 9 pages,1 figure. the chinese version of this paper has been
published in Chinese Sci Bull,2011, 56 (19):1578-158