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)

信頼度更新を用いたLDPC符号の Weighted Bit-Flipping 復号法

匡 佐藤, 剛 細谷, 秀樹 八木, 茂一 平澤

Published Nov 20, 2005• 0 citations
OpenAlex

Related papers

信頼度更新を用いたLDPC符号の Bit-Flipping 復号法の改良

裕 長谷川, 剛 細谷, 秀樹 八木 +1 more

IEEE International Symposium on Information Theory (ISIT)•Nov 28, 2006•0 citations

低密度パリティ検査符号の Bit Serial 型 Sum-Product 復号法

雅人 矢部, 吉広 栗原, 和彦 山口 +1 more

IEEE International Symposium on Information Theory (ISIT)•Dec 15, 2003•0 citations

低密度パリティ検査(LDPC)符号の Modified Weighted Bit Flipping 復号アルゴリズム

洋一 稲葉, 知明 大槻

IEEE International Symposium on Information Theory (ISIT)•Dec 15, 2003•0 citations

An Improved Low Complex Hybrid Weighted Bit-Flipping Algorithm for LDPC Codes

Michaelraj Kingston Roberts, Ramesh Jayabalan

Wireless Personal Communications•Nov 23, 2014•7 citations

Hybrid weighted bit flipping low density parity check decoding

Honey Durga Tiwari, Harsh Durga Tiwari, Kang‐Yoon Lee

Digital Signal Processing•Feb 5, 2014•5 citations

Bootstrapped Modified Weighted Bit Flipping Decoding of Low Density Parity Check Codes

Yoichi Inaba

Recently, various decoding algorithms with Low Density Parity Check (LDPC) codes have been proposed. Most algorithms can be divided into a hard decision algorithm and a soft decision algorithm. The Weighted Bit Flipping (WBF) algorithm that is between a hard decision and a soft decision algorithms has been proposed. The Bootstrapped WBF and Modified WBF algorithms have been proposed to improve the error rate performance and decoding complexity of the WBF algorithm. In this letter, we apply the Bootstrap step to the Modified WBF algorithm. We show that the Bootstrapped modified WBF algorithm outperforms the WBF, Bootstrapped WBF, and Modified WBF algorithms. Moreover, we show that the Bootstrapped modified WBF algorithm has the lowest decoding complexity.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Apr 1, 2006•2 citations
Recently, various decoding algorithms with Low Density Parity Check (LDPC) codes have been proposed. Most algorithms can be divided into a hard decision algorithm and a soft decision algorithm. The Weighted Bit Flipping (WBF) algorithm that is between a hard decision and a soft decision algorithms has been proposed. The Bootstrapped WBF and Modified WBF algorithms have been proposed to improve the error rate performance and decoding complexity of the WBF algorithm. In this letter, we apply the Bootstrap step to the Modified WBF algorithm. We show that the Bootstrapped modified WBF algorithm outperforms the WBF, Bootstrapped WBF, and Modified WBF algorithms. Moreover, we show that the Bootstrapped modified WBF algorithm has the lowest decoding complexity.