Javascript verkar inte påslaget? - Vissa delar av Lunds universitets webbplats fungerar inte optimalt utan javascript, kontrollera din webbläsares inställningar.
Du är här

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

Publiceringsår: 2008
Språk: Engelska
Dokumenttyp: Konferensbidrag


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.


  • Electrical Engineering, Electronic Engineering, Information Engineering


5th Int. Symp. Turbo Codes & Related Topics
  • Information Theory-lup-obsolete

Box 117, 221 00 LUND
Telefon 046-222 00 00 (växel)
Telefax 046-222 47 20
lu [at] lu [dot] se

Fakturaadress: Box 188, 221 00 LUND
Organisationsnummer: 202100-3211
Om webbplatsen