Modified Algorithm on Maximum Detected Bit Flipping Decoding for High Dimensional Parity-Check Code

Yuuki FUNAHASHI  Shogo USAMI  Ichi TAKUMI  Masayasu HATA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E89-A    No.10    pp.2670-2675
Publication Date: 2006/10/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e89-a.10.2670
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Coding Theory
error correcting code,  high dimensional parity-check code,  hard-in decoding,  

Full Text: PDF>>
Buy this Article

We have researched high dimensional parity-check (HDPC) codes that give good performance over a channel that has a very high error rate. HDPC code has a little coding overhead because of its simple structure. It has hard-in, maximum detected bit flipping (MDBF) decoding that has reasonable decoding performance and computational cost. In this paper, we propose a modified algorithm for MDBF decoding and compare the proposed MDBF decoding with conventional hard-in decoding.