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

Victor Zyablov, Maja Loňcar, Rolf Johannesson, Pavel Rybin

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publication2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
Pages174-179
Number of pages6
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING - Lausanne, Switzerland
Duration: 1 Sep 20085 Sep 2008

Publication series

Name2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING

Conference

Conference2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
Country/TerritorySwitzerland
CityLausanne
Period1/09/085/09/08

Fingerprint

Dive into the research topics of 'On the asymptotic performance of low-complexity decoded LDPC codes with constituent hamming codes'. Together they form a unique fingerprint.

Cite this