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.
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.
| Original language | English |
|---|---|
| Publication status | Published - 2008 |
| Event | 11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08) - Pamporovo, Bulgaria Duration: 2008 Jun 16 → … |
Conference
| Conference | 11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08) |
|---|---|
| Country/Territory | Bulgaria |
| City | Pamporovo |
| Period | 2008/06/16 → … |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering
Free keywords
- iterative decoding
- LDPC codes
- Hamming codes
- asymptotic performance