A new generalization of Reed-Solomon codes is given. This new generalization has similar information rate bound and similar distance rate bound as BCH codes. It also approaches to the Gilbert bound as Goppa codes. Nevertheless, decoding these new codes is much faster than decoding BCH codes.

翻译：本文给出Reed-Solomon码的一种新推广。该新推广具有与BCH码相似的信息率界和距离率界，且如同Goppa码一般逼近Gilbert界。然而，这些新码的解码速度远快于BCH码的解码速度。