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

被引：0

作者：

ZHANG GuoHua WANG JuHua LI XueYuan WANG XinMei State Key Laboratory of Integrated Service Networks Xidian University Xian China China Academy of Space Technology Xian Xian China ^{[1
,2
,2
,1
,1
,1
,710071
,2
,710100
]}

机构：

来源：

Chinese Science Bulletin | 2011年 / 56卷 / 12期

关键词：

low-density parity-check code; quasi-cyclic; girth; consecutive;

D O I：

暂无

中图分类号：

TN911.22 [信道编码理论];

学科分类号：

070104 ; 081101 ;

摘要：

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.

引用

页码：1277 / 1283

页数：7

共 18 条

[1]

Feedback image encryption algorithm with compound chaotic stream cipher based on perturbation[J]. TONG XiaoJun1 ＆ CUI MingGen2 1School of Computer Science and Technology, Harbin Institute of Technology, Weihai 264209, China;2School of Science, Harbin Institute of Technology, Weihai 264209, China.Science China（Information Sciences）. 2010(01)

[2] 码长连续变化的QC-LDPC码的设计 [J].

刘磊 ;

周武旸 .

电子与信息学报, 2009, 31 (10) :2523-2526

[3] 流密码与纠错码联合设计新方向——快速相关攻击译码算法研究进展 [J].

周亮 ;

李胜强 .

电子科技大学学报, 2009, 38 (05) :555-561

[4]

New related-key rectangle attacks on reduced AES-192 and AES-256[J]. WEI YongZhuang ＆ HU YuPu Key Laboratory of Computer Networks ＆ Information Security of Ministry of Education,Xidian University,Xi’an 710071,China.Science in China（Series F:Information Sciences）. 2009(04)

[5] Cryptanalysis of RSA for a special case with d>e [J].

LUO PingZHOU HaiJianWANG DaoShun DAI YiQi Tsinghua National Laboratory for Information Science and Technology TNlistDepartment of Computer Science and TechnologyTsinghua UniversityBeijing China .

ScienceinChina(SeriesF:InformationSciences), 2009, 52 (04) :609-616

[6]

Construction and enumeration of Boolean functions with maximum algebraic immunity[J]. ZHANG WenYing1,2, WU ChuanKun2 ＆ LIU XiangZhong3 1 School of Information Science and Engineering, Shandong Normal University, Jinan 250014, China;2 State Key Lab of Information Security, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China;3 No. 2 Middle School Attached to Shandong Normal University, Jinan 250014, China.Science in China（Series F:Information Sciences）. 2009(01)

[7]

Chaos block cipher for wireless sensor network[J]. CHEN Shuai1,ZHONG XianXin2 ＆ WU ZhengZhong2 1 Department of Physics,Huainan Normal University,Huainan 232001,China;2 Key Lab for Optoelectronic Technology and System,Ministry of Education,Chongqing University,Chongqing 400030,China.Science in China（Series F:Information Sciences）. 2008(08)

[8]

New designing of cryptosystems based on quadratic fields[J]. DONG XiaoLei,CAO ZhenFu ＆ WANG LiCheng Department of Computer Science and Engineering,Shanghai Jiao Tong University,Shanghai 200240,China.Science in China（Series F:Information Sciences）. 2008(08)

[9] 利用双重扩展RS码及循环MDS码构造实用化的LDPC码 [J].

张国华 ;

王新梅 .

通信学报, 2008, (06) :100-105

[10] 利用几何图形构造不含小环的LDPC码 [J].

陶雄飞 ;

刘卫忠 ;

邹雪城 .

系统工程与电子技术, 2007, (11) :1965-1968

← 1 2 →