会议专题

Combinatorial Construction of Low-Density Parity-Check Codes for Short Block Length and High Rate Applications

This paper presents a method to construct regular low-density parity-check (LDPC) codes of short block length and high rate based on a special type of combinatoric designs, i.e., balanced incomplete block designs (BIBDs) with λ = 2 whose construction are based on cyclic difference families. Although the Tanner graph of the codes constructed contains some cycles of length 4, simulation results show that they perform well under belief propagation (BP) decoding. Further, these codes are quasicyclic (QC) codes and hence can be encoded efficiently.

Suquan Ding Zhixing Yang Jian Song Changyong Pan Jun Wang

Tsinghua National Laboratory for Information Science and Technology,Department of Electronic Engineering,Tsinghua University,Beijing,100084,China

国际会议

第二届IEEE无线通讯、网络技术暨移动计算国际会议

武汉

英文

2006-09-01(万方平台首次上网日期,不代表论文的发表时间)