Regular low-density parity-check codes from combinatorial designs

Author

Johnson, Sarah J. ; Weller, Steven R.

Author_Institution

Dept. of Electr. & Comput. Eng., Newcastle Univ., NSW, Australia

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

90

Lastpage

92

Abstract

Analytically constructed LDPC codes comprise only a very small subset of possible codes and as a result LDPC codes are still, for the most part, constructed randomly. This paper extends the class of LDPC codes that can be systematically generated by presenting a construction method for regular LDPC codes based on combinatorial designs known as Kirkman triple systems. We construct (3, ρ)-regular codes whose Tanner graph is free of 4-cycles for any integer ρ, and examine girth and minimum distance properties of several classes of LDPC codes obtained from combinatorial designs

Keywords

combinatorial mathematics; error correction codes; graph theory; iterative decoding; Kirkman triple systems; LDPC codes; Tanner graph; combinatorial design; girth properties; iterative decoding; low-density parity-check codes; minimum distance properties; regular codes; Communication industry; Design optimization; Displays; Ear; Iterative algorithms; Iterative decoding; Parity check codes; Physics; Scholarships; Sparse matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Workshop, 2001. Proceedings. 2001 IEEE

Conference_Location

Cairns, Qld.

Print_ISBN

0-7803-7119-4

Type

conf

DOI

10.1109/ITW.2001.955146

Filename

955146