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

Victor Zyablov, Rolf Johannesson, Maja Loncar

Research output: Contribution to journalArticlepeer-review

12 Citations (SciVal)

Abstract

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.
Original languageEnglish
Pages (from-to)95-109
JournalProblems of Information Transmission
Volume45
Issue number2
DOIs
Publication statusPublished - 2009

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Fingerprint

Dive into the research topics of 'Low-complexity error correction of Hamming-code-based LDPC codes'. Together they form a unique fingerprint.

Cite this