Computer Science – Information Theory
Scientific paper
2008-10-07
Computer Science
Information Theory
25 pages. 11 Figures. Part of the work was presented at the Information Theory Workshop (ITW), May 5-9 2008, Porto, Portugal.
Scientific paper
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.
Chilappagari Shashi Kiran
Krishnan Anantha Raman
Marcellin Michael W.
Vasic Bane
No associations
LandOfFree
Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Low-Density Parity-Check Codes Which Can Correct Three Errors Under Iterative Decoding will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-556814