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 Error-Correcting Capabilities 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 the single parity-check constituent codes in Gallager's LDPC codes with Hamming codes. This paper investigates the asymptotic performance of ensembles of random H-LDPC codes, used over the binary symmetric channel and decoded with a low-complexity hard-decision iterative decoding algorithm. It is shown that there exist H-LDPC codes for which such iterative decoding corrects any error pattern with a number of errors that

grows linearly with the code length. The number of required decoding iterations is a logarithmic function of the code length. The fraction of correctable errors is computed numerically for different code parameters.

Publishing year

2008

Language

English

Document type

Conference paper

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • iterative decoding
  • LDPC codes
  • Hamming codes
  • asymptotic performance

Conference name

11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08)

Conference date

2008-06-16

Conference place

Pamporovo, Bulgaria

Status

Published

Research group

  • Informations- och kommunikationsteori
  • Information Theory