Decoding of Reed-Muller codes with polylogarithmic complexity
WISICT '04 Proceedings of the winter international synposium on Information and communication technologies
Recursive error correction for general Reed-Muller codes
Discrete Applied Mathematics - Special issue: Coding and cryptography
Error exponents for two soft-decision decoding algorithms of Reed-Muller codes
IEEE Transactions on Information Theory
Recursive error correction for general Reed-Muller codes
Discrete Applied Mathematics - Special issue: Coding and cryptography
| Hi-index | 754.90 |
We present a new soft-decision majority decoding algorithm for Reed-Muller codes RM(r,m). First, the reliabilities of 2m transmitted symbols are recalculated into the reliabilities of 2m-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 log10(π/2)≈2 dB at any given output error probability. For fixed code rate R and m→∞, our algorithm increases almost 2r/2 times the correcting capability of soft-decision bounded distance decoding