On maximum-length linear congruential-sequences-based low-density parity-check codes

被引：2

作者：

Sun, J ^{[1
]}

Takeshita, OY

机构：

[1] Qualcomm Inc, San Diego, CA 92121 USA

[2] Ohio State Univ, Dept Elect & Comp Engn, Columbus, OH 43210 USA

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 2005年 / 53卷 / 12期

基金：

美国国家科学基金会;

关键词：

error-correction coding; graph theory; low-density parity-check (LDPC) codes; permutation; sequences;

D O I：

10.1109/TCOMM.2005.860093

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This letter extends a low-density parity-check code construction using maximum-length linear congruential sequences by Prabhakar and Narayanan. The corresponding bipartite graphs of their construction were guaranteed to have a girth larger than four by a sufficient condition. However, their sufficient condition was limited to regular codes and data-node degree equal to three. The extension in this letter allows arbitrary data-node degrees and is applicable to irregular codes. Further, simpler sufficient conditions are derived and larger girths are addressed.

引用

页码：1977 / 1980

页数：4

共 14 条

[1] Construction of low-density parity-check codes based on balanced incomplete block designs
Ammar, B
Honary, B
Kou, Y
Xu, J
Lin, S
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) : 1257 - 1268
[2] [Anonymous], ELECT NOTES THEORETI
[3] Campello J, 2001, 2001 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-10, CONFERENCE RECORD, P55, DOI 10.1109/ICC.2001.936272
[4] Clark G.C., 1981, Error-Correction Coding for Digital Communications
[5] Johnson SJ, 2001, GLOB TELECOMM CONF, P970, DOI 10.1109/GLOCOM.2001.965562
[6] KIM JL, 2002, P 40 ALL C COMM CONT, P1024
[7] Low-density parity-check codes based on finite geometries: A rediscovery and new results
[J]. Kou, Y. (ykou@att.net), 2001, Institute of Electrical and Electronics Engineers Inc. (47)
[8] Comparison of constructions of irregular Gallager codes
Mackay, DJC
Wilson, ST
Davey, MC
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (10) : 1449 - 1454
[9] Good error-correcting codes based on very sparse matrices
MacKay, DJC
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) : 399 - 431
[10] MELLINGER K, 2003, P 3 PYTH C RHOD GREE, P341

← 1 2 →