Salvato in:
| Autori principali: | , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | https://arxiv.org/abs/2601.00122 |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866908743733608448 |
|---|---|
| author | Camps-Moreno, Eduardo Lau, Jun Bo López, Hiram H. Santos, Welington |
| author_facet | Camps-Moreno, Eduardo Lau, Jun Bo López, Hiram H. Santos, Welington |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_00122 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The permutation group of Reed-Solomon codes over arbitrary points Camps-Moreno, Eduardo Lau, Jun Bo López, Hiram H. Santos, Welington Information Theory 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. |
| title | The permutation group of Reed-Solomon codes over arbitrary points |
| topic | Information Theory |
| url | https://arxiv.org/abs/2601.00122 |