Loading [MathJax]/extensions/MathZoom.js
On the asymptotic performance of low-complexity decoded LDPC codes with constituent hamming codes | IEEE Conference Publication | IEEE Xplore

On the asymptotic performance of low-complexity decoded LDPC codes with constituent hamming codes


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 inves...Show More

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.
Date of Conference: 01-05 September 2008
Date Added to IEEE Xplore: 24 October 2008
ISBN Information:

ISSN Information:

Conference Location: Lausanne, Switzerland

References

References is not available for this document.