Efficient erasure list-decoding of Reed-Muller codes
Philippe Gaborit, Olivier Ruatta · 2006
In this paper we describe an algorithm which permits to perform the erasure list-decoding of q-ary Reed-Muller codes with a quadratic complexity in the dimension of the code rather than with the usual cubic complexity for random linear codes with not too large length. The algorithm is based on a multivariable interpolation algorithm