Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

A Decoding Algorithm of Low-Density Parity-Check Codes Using Decisions of Erasure Correcting

Gou Hosoya, Toshiyasu Matsushima, Shigeichi Hirasawa

Published Nov 20, 2005• 0 citations
OpenAlex

Related papers

An improved decoding algorithm for low-density parity-check codes over the binary erasure channel

B.N. Vellambi Ravisankar, Faramarz Fekri

•Jan 1, 2005•0 citations

On Stopping Sets and an Improved Decoding Algorithm for Low-density Parity-check Codes over the Binary Erasure Channel

Badri N. Vellambi, Faramarz Fekri

•Sep 29, 2004•0 citations

On stopping sets and an improved decoding algorithm for low density parity-check codes over the binary erasure channel

B.N. Vellambi Ravisankar, Faramarz Fekri

•Jan 1, 2004•0 citations

Hard Decision Error Correcting Scheme Based on LDPC Codes over Impulse Noise Channels

Miloš Ivković, Shuguang Robert Cui

We investigate hard decision based low-density parity-check (LDPC) codes over an impulse noise channel, which is modeled as the concatenation of a Binary Erasure Channel (BEC) and a Binary Symmetric Channel (BSC). We propose a decoding algorithm based on three-state quantization of the traditional sum-product algorithm, where the three states correspond to "1", "0", and "E" (Erasure). As such, the proposed algorithm dramatically reduces the implementation complexity, while still keeps satisfactory decoding performance as shown by simulation results.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Jan 1, 2006•0 citations

On the erasure-correcting capabilities of low-complexity decoded LDPC codes with constituent Hamming codes

Victor Zyablov, Maja Lončar, Rolf Johannesson +1 more

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.

•Jan 1, 2008•6 citations

Improvement of decoding algorithms for low-density parity-check codes

Junho Cho

•Jan 1, 2010•0 citations
We investigate hard decision based low-density parity-check (LDPC) codes over an impulse noise channel, which is modeled as the concatenation of a Binary Erasure Channel (BEC) and a Binary Symmetric Channel (BSC). We propose a decoding algorithm based on three-state quantization of the traditional sum-product algorithm, where the three states correspond to "1", "0", and "E" (Erasure). As such, the proposed algorithm dramatically reduces the implementation complexity, while still keeps satisfactory decoding performance as shown by simulation results.
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.