Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

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

Författare

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.

Publiceringsår

2008

Språk

Engelska

Publikation/Tidskrift/Serie

5th International Symposium on Turbo Codes and Related Topics

Dokumenttyp

Konferensbidrag

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • 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

Forskningsgrupp

  • Information Theory

ISBN/ISSN/Övrigt

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