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

IIAE International Conference on Industrial Application Engineering (ICIAE)

Modified Majority Logic Decoding of Reed-Muller Codes for Channel Coding

Ting‐Ya Yang, Houshou Chen, Chen-Han Chuang

Published Jan 1, 2020• 0 citations
Publisher

Abstract

This paper proposes the modify majority-logic decoding using sum-product or min-sum decoding algorithms at the highest-order information bits in RM codes. Numerical results show that, compared with the traditional majority-logic decoding algorithm, the modified majority logic decoding method proposed in this study can reduce the bit error rate (BER) considerably. This task is accomplished without incurring a significant increase in decoding complexity because soft-decision decoding is used only at the highest information bits of RM codes, whereas majority-logic decoding is still applied at the other orders of information bits.

DOI
10.12792/iciae2020.025

Related papers

Modified majority logic decoding of Reed–Muller codes using factor graphs

Ting‐Ya Yang, Houshou Chen

This study investigates the decoding algorithms of binary Reed–Muller (RM) codes. The main goal of the study is to modify majority‐logic decoding using sum‐product or min‐sum decoding algorithms at the highest‐order information bits in RM codes. Numerical results show that compared with the traditional majority‐logic decoding algorithm, the modified majority‐logic decoding method proposed in this study can reduce the bit error rate by a large margin. This is achieved without incurring a significant increase in decoding complexity because soft‐decision decoding is only used in the highest information bits in RM codes whereas majority‐logic decoding is still applied at the other orders of information bits in RM codes.

IET Communications•Jan 31, 2018•2 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•31 citations

Optimum 1-Step Majority-Logic Decoding of Binary Reed–Muller Codes

Hoang Ly, Emina Soljanin

The classical majority-logic decoder proposed by Reed for Reed-Muller codes RM(r, m) of order r and length 2^m, unfolds in r+1 sequential steps, decoding message symbols from highest to lowest degree. Several follow-up decoding algorithms reduced the number of steps, but for a limited set of parameters, or at the expense of reduced performance, or relying on the existence of some combinatorial structures. We show that any one-step majority-logic decoder-that is, a decoder performing all majority votes in one step simultaneously without sequential processing-can correct at most d_min/4 errors for all values of r and m, where d_min denotes the code's minimum distance. We then introduce a new hard-decision decoder that completes the decoding in a single step and attains this error-correction limit. It applies to all r and m, and can be viewed as a parallel realization of Reed's original algorithm, decoding all message symbols simultaneously. Remarkably, we also prove that the decoder is optimum in the erasure setting: it recovers the message from any erasure pattern of up to d_min-1 symbols-the theoretical limit. To our knowledge, this is the first 1-step decoder for RM codes that achieves both optimal erasure correction and the maximum one-step error correction capability.

arXiv:2508.08736•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•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

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 decoding of Reed-Muller codes: a simplified algorithm

Ilya I. Dumer

Soft-decision decoding is considered for general Reed-Muller (RM) codes of length n and distance d used over a memoryless channel. A recursive decoding algorithm is designed and its decoding threshold is derived for long RM codes. The algorithm has complexity of order nlnn and corrects most error patterns of the Euclidean weight of order radicn/lnn, instead of the decoding threshold radicd/2 of the bounded distance decoding. Also, for long RM codes of fixed rate R, the new algorithm increases 4/pi times the decoding threshold of its hard-decision counterpart

IEEE Transactions on Information Theory•Mar 1, 2006•59 citations
This paper proposes the modify majority-logic decoding using sum-product or min-sum decoding algorithms at the highest-order information bits in RM codes. Numerical results show that, compared with the traditional majority-logic decoding algorithm, the modified majority logic decoding method proposed in this study can reduce the bit error rate (BER) considerably. This task is accomplished without incurring a significant increase in decoding complexity because soft-decision decoding is used only at the highest information bits of RM codes, whereas majority-logic decoding is still applied at the other orders of information bits.
This study investigates the decoding algorithms of binary Reed–Muller (RM) codes. The main goal of the study is to modify majority‐logic decoding using sum‐product or min‐sum decoding algorithms at the highest‐order information bits in RM codes. Numerical results show that compared with the traditional majority‐logic decoding algorithm, the modified majority‐logic decoding method proposed in this study can reduce the bit error rate by a large margin. This is achieved without incurring a significant increase in decoding complexity because soft‐decision decoding is only used in the highest information bits in RM codes whereas majority‐logic decoding is still applied at the other orders of information bits in RM codes.
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.
The classical majority-logic decoder proposed by Reed for Reed-Muller codes RM(r, m) of order r and length 2^m, unfolds in r+1 sequential steps, decoding message symbols from highest to lowest degree. Several follow-up decoding algorithms reduced the number of steps, but for a limited set of parameters, or at the expense of reduced performance, or relying on the existence of some combinatorial structures. We show that any one-step majority-logic decoder-that is, a decoder performing all majority votes in one step simultaneously without sequential processing-can correct at most d_min/4 errors for all values of r and m, where d_min denotes the code's minimum distance. We then introduce a new hard-decision decoder that completes the decoding in a single step and attains this error-correction limit. It applies to all r and m, and can be viewed as a parallel realization of Reed's original algorithm, decoding all message symbols simultaneously. Remarkably, we also prove that the decoder is optimum in the erasure setting: it recovers the message from any erasure pattern of up to d_min-1 symbols-the theoretical limit. To our knowledge, this is the first 1-step decoder for RM codes that achieves both optimal erasure correction and the maximum one-step error correction capability.
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.
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.
Soft-decision decoding is considered for general Reed-Muller (RM) codes of length n and distance d used over a memoryless channel. A recursive decoding algorithm is designed and its decoding threshold is derived for long RM codes. The algorithm has complexity of order nlnn and corrects most error patterns of the Euclidean weight of order radicn/lnn, instead of the decoding threshold radicd/2 of the bounded distance decoding. Also, for long RM codes of fixed rate R, the new algorithm increases 4/pi times the decoding threshold of its hard-decision counterpart