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

被引：0

作者：

Zhang GuoHua ^{[1
,2
]}

Wang JuHua ^{[2
]}

Li XueYuan ^{[1
]}

Wang XinMei ^{[1
]}

机构：

[1] Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China

[2] China Acad Space Technol Xian, Xian 710100, Peoples R China

来源：

CHINESE SCIENCE BULLETIN | 2011年 / 56卷 / 12期

基金：

中国国家自然科学基金;

关键词：

low-density parity-check code; quasi-cyclic; girth; consecutive; PARITY-CHECK CODES; CONSTRUCTION; CRYPTOSYSTEMS; SEQUENCES; CIPHER;

D O I：

10.1007/s11434-010-4049-8

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

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.

引用

页码：1272 / 1277

页数：6

共 33 条

[1] Chaos block cipher for wireless sensor network [J].

Chen Shuai ;

Zhong XianXin ;

Wu ZhengZhong .

SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2008, 51 (08) :1055-1063

[2] Girth of the Tanner Graph and Error Correction Capability of LDPC Codes [J].

Chilappagari, Shashi Kiran ;

Nguyen, Dung Viet ;

Vasic, Bane ;

Marcellin, Michael W. .

2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, :1238-1245

[3] New designing of cryptosystems based on quadratic fields [J].

Dong XiaoLei ;

Cao ZhenFu ;

Wang LiCheng .

SCIENCE IN CHINA SERIES F-INFORMATION SCIENCES, 2008, 51 (08) :1106-1116

[4]

Feng DG, 1996, CHINESE SCI BULL, V41, P1494

[5] Quasi-cyclic low-density parity-check codes from circulant permutation matrices [J].

Fossorier, MPC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (08) :1788-1793

[6] A construction of high rate quasi-cyclic regular LDPC codes from cyclic difference families with girth 8 [J].

Fujisawa, Masaya ;

Sakata, Shojiro .

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2007, E90A (05) :1055-1061

[7]

GUO BA, 1993, CHINESE SCI BULL, V38, P873

[8]

GUO BA, 1992, CHINESE SCI BULL, V37, P517

[9]

[何善宝 He Shanbao], 2005, [通信学报, Journal of China Institute of Communications], V26, P81

[10] Large Girth Quasi-Cyclic LDPC Codes Based on the Chinese Remainder Theorem [J].

Jiang, Xueqin ;

Lee, Moon Ho .

IEEE COMMUNICATIONS LETTERS, 2009, 13 (05) :342-344

← 1 2 3 4 →