Advanced

Iterative decoding of generalized low-density parity-check codes

Lentmaier, Michael LU and Zigangirov, Kamil LU (1998) IEEE International Symposium on Information Theory (ISIT), 1998 In [Host publication title missing]
Abstract
A generalization of Gallager's low-density parity-check codes is introduced, where as component codes single-error correcting Hamming codes are used instead of single-error detecting parity-check codes. Low-density (LD) parity-check codes were first introduced by Gallager in 1963. These codes are, in combination with iterative decoding, very promising for achieving low error probabilities at a reasonable cost. Results of computer simulations for long LD codes show, that a performance close to the Shannon capacity limit can be achieved. In this work, we consider a generalized version of low-density parity-check codes, where the decoding procedure can be based on the decoding of Hamming component codes
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
keywords
LDPC codes, generalized LDPC codes, GLDPC codes
in
[Host publication title missing]
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
conference name
IEEE International Symposium on Information Theory (ISIT), 1998
external identifiers
  • Scopus:84890383723
ISBN
0-7803-5000-6
DOI
10.1109/ISIT.1998.708742
language
English
LU publication?
yes
id
015b5dcb-1e20-46a4-836d-34308f186883 (old id 3731560)
date added to LUP
2013-04-26 13:56:04
date last changed
2016-10-13 04:45:02
@misc{015b5dcb-1e20-46a4-836d-34308f186883,
  abstract     = {A generalization of Gallager's low-density parity-check codes is introduced, where as component codes single-error correcting Hamming codes are used instead of single-error detecting parity-check codes. Low-density (LD) parity-check codes were first introduced by Gallager in 1963. These codes are, in combination with iterative decoding, very promising for achieving low error probabilities at a reasonable cost. Results of computer simulations for long LD codes show, that a performance close to the Shannon capacity limit can be achieved. In this work, we consider a generalized version of low-density parity-check codes, where the decoding procedure can be based on the decoding of Hamming component codes},
  author       = {Lentmaier, Michael and Zigangirov, Kamil},
  isbn         = {0-7803-5000-6},
  keyword      = {LDPC codes,generalized LDPC codes,GLDPC codes},
  language     = {eng},
  publisher    = {ARRAY(0x9c07078)},
  series       = {[Host publication title missing]},
  title        = {Iterative decoding of generalized low-density parity-check codes},
  url          = {http://dx.doi.org/10.1109/ISIT.1998.708742},
  year         = {1998},
}