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

Yuuki FUNAHASHI; Shogo USAMI; Ichi TAKUMI; Masayasu HATA

doi:10.1093/ietfec/e89-a.10.2670

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

Yuuki FUNAHASHI, Shogo USAMI, Ichi TAKUMI, Masayasu HATA

Full Text Views

0

Share
Cite this

Summary :

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.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E89-A No.10 pp.2670-2675

Publication Date: 2006/10/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e89-a.10.2670

Type of Manuscript: Special Section LETTER (Special Section on Information Theory and Its Applications)

Category: Coding Theory

Cite this

Copy

Yuuki FUNAHASHI, Shogo USAMI, Ichi TAKUMI, Masayasu HATA, "Modified Algorithm on Maximum Detected Bit Flipping Decoding for High Dimensional Parity-Check Code" in IEICE TRANSACTIONS on Fundamentals, vol. E89-A, no. 10, pp. 2670-2675, October 2006, doi: 10.1093/ietfec/e89-a.10.2670.
Abstract: 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.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e89-a.10.2670/_p

Copy

@ARTICLE{e89-a_10_2670,
author={Yuuki FUNAHASHI, Shogo USAMI, Ichi TAKUMI, Masayasu HATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Modified Algorithm on Maximum Detected Bit Flipping Decoding for High Dimensional Parity-Check Code},
year={2006},
volume={E89-A},
number={10},
pages={2670-2675},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e89-a.10.2670},
ISSN={1745-1337},
month={October},}

Copy

TY - JOUR
TI - Modified Algorithm on Maximum Detected Bit Flipping Decoding for High Dimensional Parity-Check Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2670
EP - 2675
AU - Yuuki FUNAHASHI
AU - Shogo USAMI
AU - Ichi TAKUMI
AU - Masayasu HATA
PY - 2006
DO - 10.1093/ietfec/e89-a.10.2670
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E89-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2006
AB - 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.
ER -