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

Michael Lentmaier, Kamil Zigangirov

Forskningsoutput: TidskriftsbidragArtikel i vetenskaplig tidskriftPeer review

145 Citeringar (SciVal)

Sammanfattning

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.
Originalspråkengelska
Sidor (från-till)248-250
TidskriftIEEE Communications Letters
Volym3
Utgåva8
DOI
StatusPublished - 1999

Ämnesklassifikation (UKÄ)

  • Elektroteknik och elektronik

Fingeravtryck

Utforska forskningsämnen för ”On generalized low-density parity-check codes based on Hamming component codes”. Tillsammans bildar de ett unikt fingeravtryck.

Citera det här