pith. sign in

arxiv: 0810.1105 · v1 · submitted 2008-10-07 · 💻 cs.IT · math.IT

Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding

classification 💻 cs.IT math.IT
keywords codesthreeconditionscorrectdecodingerrorsgivehard-decision
0
0 comments X
read the original abstract

In this paper, we give necessary and sufficient conditions for low-density parity-check (LDPC) codes with column-weight three to correct three errors when decoded using hard-decision message-passing decoding. Additionally, we give necessary and sufficient conditions for column-weight-four codes to correct three errors in four iterations of hard-decision message-passing decoding. We then give a construction technique which results in codes satisfying these conditions. We also provide numerical assessment of code performance via simulation results.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.