Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes

Author

Lin, Shu ; Song, Shumei ; Tai, Ying Y. ; Lan, Lan ; Zeng, Lingqi

Author_Institution

Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA

Volume

2

fYear

2006

fDate

25-28 June 2006

Firstpage

1303

Lastpage

1308

Abstract

In the late 1950´s and early 1960´s, finite fields were successfully used to construct linear block codes, especially cyclic codes, with large minimum distances for correcting random errors with algebraic decoding, such as Bose-Chaudhuri-Hocqenghem (BCH) and Reed-Solomon (RS) codes. Recently it has been shown that finite fields can also be used successfully to construct binary quasi-cyclic (QC)-LDPC codes that perform very well not only over the AWGN channel but also over the binary erasure channel with iterative decoding, besides being efficiently encodable. This paper is concerned with constructions of nonbinary QC-LDPC codes based on finite fields

Keywords

AWGN channels; channel coding; cyclic codes; iterative decoding; parity check codes; AWGN channel; additive white Gaussian noise channels; binary erasure channel; iterative decoding; nonbinary QC-LDPC code construction; quasicyclic low density parity check codes; AWGN channels; Block codes; Computer errors; Error correction codes; Galois fields; Iterative decoding; Null space; Parity check codes; Reed-Solomon codes; Sparse matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, Circuits and Systems Proceedings, 2006 International Conference on

Conference_Location

Guilin

Print_ISBN

0-7803-9584-0

Electronic_ISBN

0-7803-9585-9

Type

conf

DOI

10.1109/ICCCAS.2006.284883

Filename

4064124