On generalized low-density parity-check codes based on Hamming component codes
(1999) In IEEE Communications Letters 3(8). p.248-250- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/3731734
- author
- Lentmaier, Michael LU and Zigangirov, Kamil LU
- organization
- publishing date
- 1999
- type
- Contribution to journal
- publication status
- published
- subject
- keywords
- LDPC codes, generalized LDPC codes, GLDPC codes
- in
- IEEE Communications Letters
- volume
- 3
- issue
- 8
- pages
- 248 - 250
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- external identifiers
-
- scopus:0033358305
- ISSN
- 1089-7798
- DOI
- 10.1109/4234.781010
- language
- English
- LU publication?
- yes
- id
- 63fb4d56-5774-42e4-8939-539aeaa73cae (old id 3731734)
- date added to LUP
- 2016-04-04 09:22:46
- date last changed
- 2022-01-29 17:33:07
@article{63fb4d56-5774-42e4-8939-539aeaa73cae, 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.}}, author = {{Lentmaier, Michael and Zigangirov, Kamil}}, issn = {{1089-7798}}, keywords = {{LDPC codes; generalized LDPC codes; GLDPC codes}}, language = {{eng}}, number = {{8}}, pages = {{248--250}}, publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}}, series = {{IEEE Communications Letters}}, title = {{On generalized low-density parity-check codes based on Hamming component codes}}, url = {{http://dx.doi.org/10.1109/4234.781010}}, doi = {{10.1109/4234.781010}}, volume = {{3}}, year = {{1999}}, }