H. Wasserman

TL;DR: In this paper, a new algorithm for decoding AG-codes significantly beyond the error-correction bound is presented, where given a word y whose distance to the AG-code is at most e, where e is a parameter depending on the block length and the dimension of the code, the algorithm produces all codewords that have distance /spl les/e from y.