On the decoding of algebraic-geometric codes over F/sub q/ for q>or=16

It is proved that for algebraic-geometric codes on a curve over F/sub q/ for q>or=37 or on a curve of sufficiently large genus over F/sub q/ for q>or=16 there exists a polynomial decoding algorithm up to (d*-1)/2 errors, d* being the designed minimum distance.<
>