In this work, we prove that the permutation group of a Reed-Solomon code is given by the polynomials of degree one that leave the set of evaluation points invariant. Our results provide a straightforward proof of the well-known cases of the permutation group of the Reed-Solomon code when the set of evaluation points is the whole finite field or the multiplicative group.

翻译：本文证明了Reed-Solomon码的置换群由保持评估点集不变的一次多项式构成。当评估点集为整个有限域或乘法群时，我们的结果为Reed-Solomon码置换群的经典情形提供了简洁证明。