Advanced

On the Erasure-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes

Zyablov, Victor; Loncar, Maja LU ; Johannesson, Rolf LU and Rybin, Pavel (2008) 11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08)
Abstract
Low-density parity-check (LDPC) codes can be constructed using constituent block codes other than single parity-check (SPC) codes. This paper considers random LDPC codes with constituent Hamming codes and investigates their asymptotic performance over the binary erasure channel. It is shown that there exist Hamming code-based LDPC codes which, when decoded with a low-complexity iterative algorithm, are capable of correcting any erasure pattern with a number of erasures that grows linearly with the code length. The number of decoding iterations, required to correct the erasures, is a logarithmic function of the code length. The fraction of correctable erasures is computed numerically for various choices of code parameters.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to conference
publication status
published
subject
conference name
11th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT08)
language
English
LU publication?
yes
id
db183c22-02a3-43d9-91e1-342ef916c7dc (old id 1172373)
date added to LUP
2008-07-09 10:51:01
date last changed
2016-04-16 11:29:33
@misc{db183c22-02a3-43d9-91e1-342ef916c7dc,
  abstract     = {Low-density parity-check (LDPC) codes can be constructed using constituent block codes other than single parity-check (SPC) codes. This paper considers random LDPC codes with constituent Hamming codes and investigates their asymptotic performance over the binary erasure channel. It is shown that there exist Hamming code-based LDPC codes which, when decoded with a low-complexity iterative algorithm, are capable of correcting any erasure pattern with a number of erasures that grows linearly with the code length. The number of decoding iterations, required to correct the erasures, is a logarithmic function of the code length. The fraction of correctable erasures is computed numerically for various choices of code parameters.},
  author       = {Zyablov, Victor and Loncar, Maja and Johannesson, Rolf and Rybin, Pavel},
  language     = {eng},
  title        = {On the Erasure-Correcting Capabilities of Low-Complexity Decoded LDPC Codes with Constituent Hamming Codes},
  year         = {2008},
}