High-rate LDPC codes from unital designs

Author

Johnson, S.J. ; Weller, S.R.

Author_Institution

Sch. of Electr. Eng. & Comput. Sci., Univ. of Newcastle, Callaghan, NSW, Australia

Volume

4

fYear

2003

fDate

1-5 Dec. 2003

Firstpage

2036

Abstract

The paper presents a construction of very high-rate low-density parity-check (LDPC) codes based on incidence matrices of unital designs. Like the projective geometry and oval designs, unital designs exist with incidence matrices which are significantly rank deficient. Thus high-rate LDPC codes with a large number of linearly dependent parity-check equations can be constructed. The LDPC codes from unitals have Tanner graphs free of 4-cycles and perform well with iterative decoding, offering new LDPC codes at rates and lengths not available with existing algebraic LDPC codes.

Keywords

graph theory; iterative decoding; parity check codes; sparse matrices; Tanner graphs; algebraic LDPC codes; algebraic codes; incidence matrices; iterative decoding; linearly dependent parity-check equations; low-density parity-check codes; oval designs; projective geometry designs; sparse matrix; sparse parity-check matrix; unital designs; Australia; Computer science; Displays; Equations; Error analysis; Geometry; Iterative algorithms; Iterative decoding; Parity check codes; Sparse matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE

Print_ISBN

0-7803-7974-8

Type

conf

DOI

10.1109/GLOCOM.2003.1258594

Filename

1258594