On the Error-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes
(2008) 11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08)- Abstract
- Hamming code-based LDPC (H-LDPC) block codes are obtained by replacing the single parity-check constituent codes in Gallager's LDPC codes with Hamming codes. This paper investigates the asymptotic performance of ensembles of random H-LDPC codes, used over the binary symmetric channel and decoded with a low-complexity hard-decision iterative decoding algorithm. It is shown that there exist H-LDPC codes for which such iterative decoding corrects any error pattern with a number of errors that
grows linearly with the code length. The number of required decoding iterations is a logarithmic function of the code length. The fraction of correctable errors is computed numerically for different code parameters.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1172364
- author
- Zyablov, Victor ; Loncar, Maja LU ; Johannesson, Rolf LU and Rybin, Pavel
- organization
- publishing date
- 2008
- type
- Contribution to conference
- publication status
- published
- subject
- keywords
- iterative decoding, LDPC codes, Hamming codes, asymptotic performance
- conference name
- 11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08)
- conference location
- Pamporovo, Bulgaria
- conference dates
- 2008-06-16
- language
- English
- LU publication?
- yes
- id
- 2bfe62d9-5934-4f3c-b0b1-6c6adfa5bc99 (old id 1172364)
- date added to LUP
- 2016-04-04 12:51:37
- date last changed
- 2018-11-21 21:11:06
@misc{2bfe62d9-5934-4f3c-b0b1-6c6adfa5bc99, abstract = {{Hamming code-based LDPC (H-LDPC) block codes are obtained by replacing the single parity-check constituent codes in Gallager's LDPC codes with Hamming codes. This paper investigates the asymptotic performance of ensembles of random H-LDPC codes, used over the binary symmetric channel and decoded with a low-complexity hard-decision iterative decoding algorithm. It is shown that there exist H-LDPC codes for which such iterative decoding corrects any error pattern with a number of errors that<br/><br> grows linearly with the code length. The number of required decoding iterations is a logarithmic function of the code length. The fraction of correctable errors is computed numerically for different code parameters.}}, author = {{Zyablov, Victor and Loncar, Maja and Johannesson, Rolf and Rybin, Pavel}}, keywords = {{iterative decoding; LDPC codes; Hamming codes; asymptotic performance}}, language = {{eng}}, title = {{On the Error-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes}}, url = {{https://lup.lub.lu.se/search/files/6010639/1172366.pdf}}, year = {{2008}}, }