Low-complexity error correction of Hamming-code-based LDPC codes
Author
Summary, in English
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.
Publishing year
2009
Language
English
Pages
95-109
Publication/Series
Problems of Information Transmission
Volume
45
Issue
2
Document type
Journal article
Publisher
Springer
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Status
Published
Research group
- Electromagnetic theory
- Information Theory
ISBN/ISSN/Other
- ISSN: 0032-9460