Error exponents are studied for the recursive and majority decoding algorithms of general Reed-Muller codes RM(r, m) used on the AWGN channels. Both algorithms have low decoding complexity and substantially outperform bounded distance decoding in their error-correcting capabilities. We obtain asymptotically tight upper bounds on the output error rate that hold for both algorithms and can be used for any RM-code.
['Marat V. Burnashev', 'Ilya Dumer']
Error exponents for two soft decision decoding algorithms of Reed-Muller codes