Title :
Efficient erasure list-decoding of Reed-Muller codes
Author :
Gaborit, Philippe ; Ruatta, Olivier
Author_Institution :
XLIM, Univ. de Limoges
Abstract :
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
Keywords :
Reed-Muller codes; computational complexity; decoding; interpolation; cubic complexity; erasure list-decoding; multivariable interpolation algorithm; q-ary Reed-Muller codes; quadratic complexity; random linear codes; Arithmetic; Decoding; Error correction; Error correction codes; Galois fields; Hamming distance; Interpolation; Linear code; Parity check codes; Reed-Solomon codes; Reed-Muller codes; erasure list-decoding; interpolation;
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
DOI :
10.1109/ISIT.2006.261692
