Enhanced Recursive Reed-Muller Erasure Decoding
  Recent work have shown that Reed-Muller (RM) codes achieve the erasure channel capacity. However, this performance is obtained with maximum-likelihood decoding which can be costly for practical applications. In this paper, we propose an encoding/decoding scheme for Reed-Muller codes on the packet erasure channel based on Plotkin construction. We present several improvements over the generic decoding. They allow, for a light cost, to compete with maximum-likelihood decoding performance, especially on high-rate codes, while significantly outperforming it in terms of speed. 
Alexandre Soro, Jerome Lacan, Vincent Roca, Valentin Savin and Mathieu   Cunche
cs.IT math.IT