List decoding algorithm based on voting in Gröbner bases for general one-point AG codes.

We generalize the unique decoding algorithm for one-point AG codes over the Miura–Kamiya C a b curves proposed by Lee et al. (2012) to general one-point AG codes, without any assumption. We also extend their unique decoding algorithm to list decoding, modify it so that it can be used with the Feng–Rao improved code construction, prove equality between its error correcting capability and half the minimum distance lower bound by Andersen and Geil (2008) that has not been done in the original proposal except for one-point Hermitian codes, remove the unnecessary computational steps so that it can run faster, and analyze its computational complexity in terms of multiplications and divisions in the finite field. As a unique decoding algorithm, the proposed one is empirically and theoretically as fast as the BMS algorithm for one-point Hermitian codes. As a list decoding algorithm, extensive experiments suggest that it can be much faster for many moderate size/usual inputs than the algorithm by Beelen and Brander (2010) . It should be noted that as a list decoding algorithm the proposed method seems to have exponential worst-case computational complexity while the previous proposals ( Beelen and Brander, 2010; Guruswami and Sudan, 1999 ) have polynomial ones, and that the proposed method is expected to be slower than the previous proposals for very large/special inputs. [ABSTRACT FROM AUTHOR]