On generalized low-density parity-check codes based on Hamming component codes

Michael Lentmaier, Kamil Zigangirov

Research output: Contribution to journalArticlepeer-review

145 Citations (SciVal)

Abstract

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.
Original languageEnglish
Pages (from-to)248-250
JournalIEEE Communications Letters
Volume3
Issue number8
DOIs
Publication statusPublished - 1999

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • LDPC codes
  • generalized LDPC codes
  • GLDPC codes

Fingerprint

Dive into the research topics of 'On generalized low-density parity-check codes based on Hamming component codes'. Together they form a unique fingerprint.

Cite this