An algorithm that, for codes from a regular plane curve, corrects up to (d*/2)-(m/sup 2//8)+(m/4)-(9/8) errors, where d* is the designed distance and m is the degree of the curve, was presented in an earlier work (see ibid., vol.35, p.811-21, 1989). It is now shown that this bound is the best possible for the algorithm considered. >
['H. E. Jensen', 'Tom Høholdt', 'Jørn Justesen']
On the number of correctable errors for some AG-codes