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

International Symposium on Information Theory and its Applications

An Iterative Bit-Flipping Decoding Algorithm For Binary Reed-Muller Codes *

Yong-Ting Ni, Cheng-Yu Pai, Chao‐Yu Chen

Published Oct 24, 2020• 1 citation
OpenAlex

Abstract

This paper presents an iterative bit-flipping (BF) decoding algorithm for binary Reed-Muller (RM) codes. The BF decoding algorithm is a hard-decision decoding algorithm. According to the updated hard reliability measures, one bit of the received hard-decision sequence is flipped at a time in each iteration. The simulation results show that the proposed BF decoding algorithm outperforms the conventional hard-decision majority decoding.

Related papers

Iterative Hard-Decision Decoding Algorithms for Binary Reed-Muller Codes

Yong-Ting Ni, Duc Nhat Nguyen, Feng-Kai Liao +2 more

In this paper, novel hard-decision iterative decoding algorithms for binary Reed-Muller (RM) codes are presented. First, two algorithms are devised based on the majority-logic decoding algorithm with reliability measures of the received sequence. The bit-flipping (BF) and the normalized bit-flipping (NBF) decoding algorithms are hard-decision decoding algorithms. According to the updated hard reliability measures, the BF and NBF algorithms flip one bit of the received hard-decision sequence at a time in each iteration. The NBF decoding algorithm performs better than the BF decoding algorithm by normalizing the reliability measures of the information bits. Moreover, the BF and NBF algorithms are modified to flip multiple bits in one iteration to reduce the average number of iterations. The modified decoding algorithms are called the multiple-bits-flipping (MBF) algorithm and the normalized multiple-bits-flipping (NMBF) algorithm, respectively. The proposed algorithms have low computational complexities and can converge rapidly after a small number of iterations. The simulation results show that the proposed hard-decision decoding algorithms outperform the conventional decoding algorithm.

IEEE Access•Jan 1, 2022•0 citations

Soft decision majority decoding

Ilya I. Dumer, R.E. Krichevskiy

We present a new soft decision majority decoding algorithm for Reed-Muller codes RM(r,m). First, the reliabilities of all received symbols are recalculated into the reliabilities of the parity checks that represent each information bit. In turn, information bits are obtained by the weighted majority that gives more weight to the more reliable parity checks. It is proven that for long low-rate codes RM(r,m), our soft decision algorithm outperforms its conventional hard decision counterpart by 10 log/sub 10/(/spl pi//2)/spl ap/2 dB at any given output bit error rate /spl epsi/<1/2.

IEEE International Symposium on Information Theory (ISIT)•Nov 7, 2002•0 citations

Soft-decision majority decoding of Reed-Muller codes

Ilya I. Dumer, R.E. Krichevskiy

We present a new soft-decision majority decoding algorithm for Reed-Muller codes RM(r,m). First, the reliabilities of 2/sup m/ transmitted symbols are recalculated into the reliabilities of 2/sup m-r/ parity checks that represent each information bit. In turn, information bits are obtained by the weighted majority that gives more weight to more reliable parity checks. It is proven that for long low-rate codes RM(r,m), our soft-decision algorithm outperforms its conventional hard-decision counterpart by 10 log/sub 10/(/spl pi//2)/spl ap/2 dB at any given output error probability. For fixed code rate R and m/spl rarr//spl infin/, our algorithm increases almost 2/sup r/2/ times the correcting capability of soft-decision bounded distance decoding.

IEEE Transactions on Information Theory•Jan 1, 2000•33 citations

The Novel Modified Weighted Bit-Flipping Decoding Algorithms for Reed-Muller Codes with Simple Scaling and SNR Adaption

Yufang Yin, Yingsong Chen

Bit-flipping (BF) algorithm has been widely employed in decoding linear block codes because of its simple implementation. We consider the most popular modified weighted bit-flipping (MWBF) algorithm and propose two novel LLR scaling based MWBF algorithms for RM (Reed-Muller) decoding. By introducing the log likelihood ratio as the scaling factor to tune the bit-based message and then approximately approaching the SNR adaption, the proposed two decoding algorithms outperform regular MWBF method with similar computational cost.

IEEE International Conference on Computer and Communications (ICCC)•Dec 11, 2020•0 citations

An efficient bit-flipping decoding algorithm for LDPC codes

Tso-Cho Chen

In this paper, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.

Cross Strait Quad-Regional Radio Science and Wireless Technology Conference (CSQRWC)•Jul 1, 2012•7 citations

Reinforcement Learning for Channel Coding: Learned Bit-Flipping Decoding

Fabrizio Carpi, Christian Häger, Marco Martalò +2 more

In this paper, we use reinforcement learning to find effective decoding strategies for binary linear codes. We start by reviewing several iterative decoding algorithms that involve a decision-making process at each step, including bit-flipping (BF) decoding, residual belief propagation, and anchor decoding. We then illustrate how such algorithms can be mapped to Markov decision processes allowing for data-driven learning of optimal decision strategies, rather than basing decisions on heuristics or intuition. As a case study, we consider BF decoding for both the binary symmetric and additive white Gaussian noise channel. Our results show that learned BF decoders can offer a range of performance-complexity trade-offs for the considered Reed-Muller and BCH codes, and achieve near-optimal performance in some cases. We also demonstrate learning convergence speed-ups when biasing the learning process towards correct decoding decisions, as opposed to relying only on random explorations and past knowledge.

•Jan 1, 2019•20 citations
This paper presents an iterative bit-flipping (BF) decoding algorithm for binary Reed-Muller (RM) codes. The BF decoding algorithm is a hard-decision decoding algorithm. According to the updated hard reliability measures, one bit of the received hard-decision sequence is flipped at a time in each iteration. The simulation results show that the proposed BF decoding algorithm outperforms the conventional hard-decision majority decoding.
In this paper, novel hard-decision iterative decoding algorithms for binary Reed-Muller (RM) codes are presented. First, two algorithms are devised based on the majority-logic decoding algorithm with reliability measures of the received sequence. The bit-flipping (BF) and the normalized bit-flipping (NBF) decoding algorithms are hard-decision decoding algorithms. According to the updated hard reliability measures, the BF and NBF algorithms flip one bit of the received hard-decision sequence at a time in each iteration. The NBF decoding algorithm performs better than the BF decoding algorithm by normalizing the reliability measures of the information bits. Moreover, the BF and NBF algorithms are modified to flip multiple bits in one iteration to reduce the average number of iterations. The modified decoding algorithms are called the multiple-bits-flipping (MBF) algorithm and the normalized multiple-bits-flipping (NMBF) algorithm, respectively. The proposed algorithms have low computational complexities and can converge rapidly after a small number of iterations. The simulation results show that the proposed hard-decision decoding algorithms outperform the conventional decoding algorithm.
We present a new soft decision majority decoding algorithm for Reed-Muller codes RM(r,m). First, the reliabilities of all received symbols are recalculated into the reliabilities of the parity checks that represent each information bit. In turn, information bits are obtained by the weighted majority that gives more weight to the more reliable parity checks. It is proven that for long low-rate codes RM(r,m), our soft decision algorithm outperforms its conventional hard decision counterpart by 10 log/sub 10/(/spl pi//2)/spl ap/2 dB at any given output bit error rate /spl epsi/<1/2.
We present a new soft-decision majority decoding algorithm for Reed-Muller codes RM(r,m). First, the reliabilities of 2/sup m/ transmitted symbols are recalculated into the reliabilities of 2/sup m-r/ parity checks that represent each information bit. In turn, information bits are obtained by the weighted majority that gives more weight to more reliable parity checks. It is proven that for long low-rate codes RM(r,m), our soft-decision algorithm outperforms its conventional hard-decision counterpart by 10 log/sub 10/(/spl pi//2)/spl ap/2 dB at any given output error probability. For fixed code rate R and m/spl rarr//spl infin/, our algorithm increases almost 2/sup r/2/ times the correcting capability of soft-decision bounded distance decoding.
Bit-flipping (BF) algorithm has been widely employed in decoding linear block codes because of its simple implementation. We consider the most popular modified weighted bit-flipping (MWBF) algorithm and propose two novel LLR scaling based MWBF algorithms for RM (Reed-Muller) decoding. By introducing the log likelihood ratio as the scaling factor to tune the bit-based message and then approximately approaching the SNR adaption, the proposed two decoding algorithms outperform regular MWBF method with similar computational cost.
In this paper, a new method for improving hard-decision bit-flipping (BF) decoding is proposed for low-density parity-check codes. The flipping criterion is derived theoretically from the soft-decision belief-propagation decoding algorithm. The proposed BF decoding algorithm is channel independent and is improved by introducing a more efficient method for computing the reliability of the parity checks. Extensive simulations are provided to demonstrate the efficiency of the proposed algorithm. Simulation results show that the proposed algorithm can achieve about 1.5dB coding gain improvement at BER = 5×10−6while reducing up to 48% iterations for decoding and maintaining low decoding complexity, compared with the conventional weighted BF algorithm.
In this paper, we use reinforcement learning to find effective decoding strategies for binary linear codes. We start by reviewing several iterative decoding algorithms that involve a decision-making process at each step, including bit-flipping (BF) decoding, residual belief propagation, and anchor decoding. We then illustrate how such algorithms can be mapped to Markov decision processes allowing for data-driven learning of optimal decision strategies, rather than basing decisions on heuristics or intuition. As a case study, we consider BF decoding for both the binary symmetric and additive white Gaussian noise channel. Our results show that learned BF decoders can offer a range of performance-complexity trade-offs for the considered Reed-Muller and BCH codes, and achieve near-optimal performance in some cases. We also demonstrate learning convergence speed-ups when biasing the learning process towards correct decoding decisions, as opposed to relying only on random explorations and past knowledge.