On generalized low-density parity-check codes based on Hamming component codes
Författare
Summary, in English
In this paper we investigate a generalization of Gallager's (1963) low-density (LD) parity-check codes, where as component codes single error correcting Hamming codes are used instead of single error detecting parity-check codes. It is proved that there exist such generalized low-density (GLD) codes for which the minimum distance is growing linearly with the block length, and a lower bound of the minimum distance is given. We also study iterative decoding of GLD codes for the communication over an additive white Gaussian noise channel. The performance in terms of the bit error rate, obtained by computer simulations, is presented for GLD codes of different lengths.
Publiceringsår
1999
Språk
Engelska
Sidor
248-250
Publikation/Tidskrift/Serie
IEEE Communications Letters
Volym
3
Issue
8
Dokumenttyp
Artikel i tidskrift
Förlag
IEEE - Institute of Electrical and Electronics Engineers Inc.
Ämne
- Electrical Engineering, Electronic Engineering, Information Engineering
Nyckelord
- LDPC codes
- generalized LDPC codes
- GLDPC codes
Status
Published
Forskningsgrupp
- Telecommunication Theory
ISBN/ISSN/Övrigt
- ISSN: 1089-7798