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

Low-complexity error correction of Hamming-code-based LDPC codes

Publiceringsår: 2009
Språk: Engelska
Sidor: 95-109
Publikation/Tidskrift/Serie: Problems of Information Transmission
Volym: 45
Nummer: 2
Dokumenttyp: Artikel i tidskrift
Förlag: Springer


Ensembles of binary random LDPC block codes constructed using Hamming codes as constituent codes are studied for communicating over the binary symmetric channel. These ensembles are known to contain codes that asymptotically almost meet the Gilbert-Varshamov bound. It is shown that in these ensembles there exist codes which can correct a number of errors that grows linearly with the code length, when decoded with a low-complexity iterative decoder, which requires a number of iterations that is a logarithmic function of the code length. The results are supported by numerical examples, for various choices of the code parameters.


  • Electrical Engineering, Electronic Engineering, Information Engineering


  • Electromagnetic theory-lup-obsolete
  • Information Theory-lup-obsolete
  • ISSN: 0032-9460

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