摘要
Generally speaking, the parameters of algebraic-geometric codes are better, but there is still not a good decoding algorithm to get these codes go into practice. This note shows an algorithm with less computation. Let X be a smooth projective algebraic curve over F<sub>q</sub> which is a finite field with q elements, and P<sub>1</sub>, …, P<sub>n</sub> be n F<sub>q</sub>-rational points of X. Consider two divisors D, G:
