Low-complexity error correction of Hamming-code-based LDPC codes
(2009) In Problems of Information Transmission 45(2). p.95-109- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1460879
- author
- Zyablov, Victor ; Johannesson, Rolf LU and Loncar, Maja LU
- organization
- publishing date
- 2009
- type
- Contribution to journal
- publication status
- published
- subject
- in
- Problems of Information Transmission
- volume
- 45
- issue
- 2
- pages
- 95 - 109
- publisher
- Springer
- external identifiers
-
- wos:000268246600002
- scopus:67749104169
- ISSN
- 0032-9460
- DOI
- 10.1134/S0032946009020021
- language
- English
- LU publication?
- yes
- id
- 0aee85c0-3340-42a4-96cc-0c9fb772bf6d (old id 1460879)
- date added to LUP
- 2016-04-01 14:36:34
- date last changed
- 2022-02-19 19:57:28
@article{0aee85c0-3340-42a4-96cc-0c9fb772bf6d, 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.}}, author = {{Zyablov, Victor and Johannesson, Rolf and Loncar, Maja}}, issn = {{0032-9460}}, language = {{eng}}, number = {{2}}, pages = {{95--109}}, publisher = {{Springer}}, series = {{Problems of Information Transmission}}, title = {{Low-complexity error correction of Hamming-code-based LDPC codes}}, url = {{http://dx.doi.org/10.1134/S0032946009020021}}, doi = {{10.1134/S0032946009020021}}, volume = {{45}}, year = {{2009}}, }