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码。