The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

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

På svenska

Author

Summary, in English

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.

Publishing year

2008

Language

English

Publication/Series

5th International Symposium on Turbo Codes and Related Topics

Document type

Conference paper

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

5th Int. Symp. Turbo Codes & Related Topics

Conference date

2008-09-01

Conference place

Lausanne, Switzerland

Status

Published

Research group

  • Information Theory

ISBN/ISSN/Other

  • ISBN: 978-1-4244-2862-5