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

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.