Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings

Author

Lan, L. ; Zeng, L.-Q. ; Tai, Y.Y. ; Lin, S. ; Abdel-Ghaffar, K.

Author_Institution

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

fYear

2005

fDate

4-9 Sept. 2005

Firstpage

2285

Lastpage

2289

Abstract

This paper presents two algebraic methods for constructing efficiently encodable quasi-cyclic (QC) LDPC codes that perform well on both the AWGN and binary erasure channels with iterative decoding in terms of bit-error performance, block error performance and error-floor, collectively. The constructions are based on the cyclic subgroups of the multiplicative groups of finite fields and affine mappings

Keywords

AWGN channels; cyclic codes; group theory; iterative decoding; parity check codes; AWGN channel; affine mappings; algebraic methods; binary erasure channel; bit-error performance; block error performance; cyclic subgroups; finite fields; iterative decoding; multiplicative groups; quasi-cyclic LDPC codes; AWGN; Belief propagation; Galois fields; Geometry; Iterative decoding; Null space; Parity check codes; Performance analysis; Sparse matrices;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on

Conference_Location

Adelaide, SA

Print_ISBN

0-7803-9151-9

Type

conf

DOI

10.1109/ISIT.2005.1523755

Filename

1523755

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2275721