Tight lower bound of consecutive lengths for QC-LDPC codes with girth at least ten  

作　　者：ZHANG GuoHua WANG JuHua LI XueYuan WANG XinMei 

机构地区：[1]State Key Laboratory of Integrated Service Networks, Xidian University, Xi'an 710071, China [2]China Academy of Space Technology (Xi'an), Xi' an 710100, China

出　　处：《Chinese Science Bulletin》2011年第12期1272-1277,共6页

基　　金：supported by the National Basic Research Program of China (2010CB328300);the National Natural Science Foundation of China (U0635003);"111" Project (B08038)

摘　　要：For an arbitrary (3,L) quasi-cyclic(QC) low-density parity-check (LDPC) code with girth at least ten, a tight lower bound of the consecutive lengths is presented. For an arbitrary length above the bound the corresponding LDPC code necessarily has a girth at least ten, and for the length equal to the bound, the resultant code inevitably has a girth smaller than ten. This new conclusion can be well applied to some important issues, such as 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, as well as the construction of LDPC codes with the guaranteed error correction capability.For an arbitrary （3,L） quasi-cyclic（QC） low-density parity-check （LDPC） code with girth at least ten, a tight lower bound of the consecutive lengths is presented. For an arbitrary length above the bound the corresponding LDPC code necessarily has a girth at least ten, and for the length equal to the bound, the resultant code inevitably has a girth smaller than ten. This new conclusion can be well applied to some important issues, such as 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, as well as the construction of LDPC codes with the guaranteed error correction capability.

关 键 词：LDPC码 任意长度 周长 QC 低密度校验码 中国剩余定理 纠错能力 代码 

分 类 号：TN911.22[电子电信—通信与信息系统] S758.1[电子电信—信息与通信工程]