Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

On the Asymptotic Performance of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes

Zyablov, Victor ; Loncar, Maja LU ; Johannesson, Rolf LU and Rybin, Pavel (2008) 5th Int. Symp. Turbo Codes & Related Topics
Abstract
Hamming code-based LDPC (H-LDPC) block codes are obtained by replacing single parity-check codes in Gallager's LDPC codes with Hamming constituent codes. This paper investigates the asymptotic error-correcting capabilities of ensembles of random H-LDPC codes, used over the binary symmetric channel and decoded with a low-complexity hard-decision iterative decoding algorithm. The number of required decoding iterations is a logarithmic function of the code length. It is shown that there exist H-LDPC codes for which such an iterative decoding corrects any error pattern with a number of errors that grows linearly with the code length. For various choices of code parameters the results are supported by numerical examples.
Please use this url to cite or link to this publication:
author
; ; and
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
host publication
5th International Symposium on Turbo Codes and Related Topics
publisher
IEEE - Institute of Electrical and Electronics Engineers Inc.
conference name
5th Int. Symp. Turbo Codes & Related Topics
conference location
Lausanne, Switzerland
conference dates
2008-09-01
external identifiers
  • scopus:57849116991
ISBN
978-1-4244-2862-5
DOI
10.1109/TURBOCODING.2008.4658693
language
English
LU publication?
yes
id
77481262-378b-4d28-9001-eeabfb879f34 (old id 1172379)
date added to LUP
2016-04-04 14:04:25
date last changed
2022-02-01 20:36:59
@inproceedings{77481262-378b-4d28-9001-eeabfb879f34,
  abstract     = {{Hamming code-based LDPC (H-LDPC) block codes are obtained by replacing single parity-check codes in Gallager's LDPC codes with Hamming constituent codes. This paper investigates the asymptotic error-correcting capabilities of ensembles of random H-LDPC codes, used over the binary symmetric channel and decoded with a low-complexity hard-decision iterative decoding algorithm. The number of required decoding iterations is a logarithmic function of the code length. It is shown that there exist H-LDPC codes for which such an iterative decoding corrects any error pattern with a number of errors that grows linearly with the code length. For various choices of code parameters the results are supported by numerical examples.}},
  author       = {{Zyablov, Victor and Loncar, Maja and Johannesson, Rolf and Rybin, Pavel}},
  booktitle    = {{5th International Symposium on Turbo Codes and Related Topics}},
  isbn         = {{978-1-4244-2862-5}},
  language     = {{eng}},
  publisher    = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
  title        = {{On the Asymptotic Performance of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes}},
  url          = {{https://lup.lub.lu.se/search/files/95046200/1172380.pdf}},
  doi          = {{10.1109/TURBOCODING.2008.4658693}},
  year         = {{2008}},
}