The permutation group of Reed-Solomon codes over arbitrary points
Information Theory
2026-01-05 v1 math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.2601.00122,
title = {The permutation group of Reed-Solomon codes over arbitrary points},
author = {Eduardo Camps-Moreno and Jun Bo Lau and Hiram H. López and Welington Santos},
journal= {arXiv preprint arXiv:2601.00122},
year = {2026}
}