A new generalization of Reed-Solomon codes is given. Like Goppa codes, our codes also approach to the Gilbert bound. Nevertheless, decoding these new codes does not require us to know the roots of the minimal polynomial of the syndromes.

翻译：给出了Reed-Solomon码的一种新推广。与Goppa码类似，我们的码也渐进逼近Gilbert界。然而，译码这些新码时无需获知伴随式极小多项式的根。