Recursive and permutation decoding for Reed-Muller codes
Ilya I. Dumer, Kirill Shabunov · 2003
Two new recursive techniques are described for Reed-Muller (RM) codes and their subcodes. We show that these algorithms yield a substantial asymptotic gain over other nonexponential algorithms known for RM codes. Decoding performance is further enhanced by using intermediate code lists and permutation procedures.