Near-Shannon-limit quasi-cyclic low-density parity-check codes

被引：146

作者：

Chen, L ^{[1
]}

Xu, J ^{[1
]}

Djurdjevic, I ^{[1
]}

Lin, S ^{[1
]}

机构：

[1] Univ Calif Davis, Davis, CA 95616 USA

来源：

IEEE TRANSACTIONS ON COMMUNICATIONS | 2004年 / 52卷 / 07期

基金：

美国国家科学基金会; 美国国家航空航天局;

关键词：

circulants; decomposition; descendants; quasicyclic;

D O I：

10.1109/TCOMM.2004.831353

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

This letter presents two classes of quasi-cyclic low-density parity-check codes that perform close to the Shannon limit.

引用

页码：1038 / 1042

页数：5

共 9 条

[1]

Blake I. F., 1975, MATH THEORY CODING

[2] 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)

[3]

LI ZW, UNPUB IEEE T COMMUN

[4]

Lin S., 2004, ERROR CONTROL CODING

[5] Good error-correcting codes based on very sparse matrices [J].

MacKay, DJC .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (02) :399-431

[6]

Peterson W. W., 1972, ERROR CORRECTING COD

[7] Design of capacity-approaching irregular low-density parity-check codes [J].

Richardson, TJ ;

Shokrollahi, MA ;

Urbanke, RL .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :619-637

[8]

TANG H, IN PRESS IEEE T INFO

[9] A RECURSIVE APPROACH TO LOW COMPLEXITY CODES [J].

TANNER, RM .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (05) :533-547

← 1 →