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

Author

Ding, Suquan ; Yang, Zhixing ; Song, Jian ; Pan, Changyong ; Wang, Jun

Author_Institution

Dept. of Electron. Eng., Tsinghua Univ., Beijing

fYear

2006

fDate

22-24 Sept. 2006

Firstpage

1

Lastpage

4

Abstract

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 lambda = 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 quasi-cyclic (QC) codes and hence can be encoded efficiently

Keywords

block codes; cyclic codes; graph theory; parity check codes; LDPC; Tanner graph; balanced incomplete block designs; belief propagation decoding; combinatorial construction; cyclic difference; high rate applications; low-density parity-check codes; quasicyclic codes; short block length; Belief propagation; Combinatorial mathematics; Design engineering; Displays; Information science; Iterative decoding; Laboratories; Parity check codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications, Networking and Mobile Computing, 2006. WiCOM 2006.International Conference on

Conference_Location

Wuhan

Print_ISBN

1-4244-0517-3

Type

conf

DOI

10.1109/WiCOM.2006.140

Filename

4149317