一类围长至少为6的QC-LDPC码的存在性  

On the existence of a class of QC-LDPC codes with girth at least six

作　　者：张国华[1] 王新梅[1] 

机构地区：[1]西安电子科技大学综合业务网理论及关键技术国家重点实验室,陕西西安710071

出　　处：《西安电子科技大学学报》2011年第3期136-139,149,共5页Journal of Xidian University

基　　金：973资助项目(2010CB328300);国家自然科学基金资助项目(U0635003;61001131);111工程资助项目(B08038)

摘　　要：对于列重为3和4,围长至少为6的QC-LDPC码,M.Hagiwara等学者最近研究了其循环置换矩阵(CPM)尺寸p的最小值,并提出了一个公开问题:当m大于等于50时,列重为4、行重为6m+3、p值为6m+3,且满足围长至少为6的QC-LDPC码是否存在?笔者基于矩阵复合的方法,证明了使这类QC-LDPC码存在的m有无穷多种.For QC-LDPC codes with column weights of three and four, and girth of at least six, M. Hagiwara et al recently investigated the smallest value of the dimension p of the cyclic permutation matrix, and remarked that for m greater than or equal to 50, the existence of QC-LDPC codes with column weight of four, row weight of 6m＋3, dimension of 6m＋3 and girth of at least six, remains open. By the method of matrix combination, it is proved in this paper that there exist infinite values of m which enable such codes to exist.

关 键 词：LDPC码 准循环 围长 存在性 

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