On the structure of polynomial ideal codes and additive Reed--Solomon codes

@misc{martinezpenas2026structure,
  title = {{On the structure of polynomial ideal codes and additive Reed--Solomon codes}},
  author = {Umberto Martínez-Peñas and Rubén Rodríguez-Ballesteros},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.21509},
  eprint = {2610.21509},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.21509},
}

TY  - UNPB
TI  - On the structure of polynomial ideal codes and additive Reed--Solomon codes
AU  - Umberto Martínez-Peñas
AU  - Rubén Rodríguez-Ballesteros
PY  - 2026
DA  - 2026/10/15
PB  - arXiv
DO  - 10.48550/arxiv.2610.21509
UR  - https://arxiv.org/abs/2610.21509
AB  - We study structural properties of polynomial ideal (PI) codes and additive Reed--Solomon (aRS) codes in the folded Hamming metric (equivalently, the Hamming metric over a larger alphabet). We first determine the maximum possible length of PI codes, prove that the dual of every PI code is a generalized PI code, and deduce that PI codes are dually QMDS together with an explicit formula for their weight distribution. We then show that PI codes defined by irreducible polynomials correspond to aRS codes with pairwise nonconjugate evaluation points. For these aRS codes, the previous results on PI codes apply (duality, QMDS property and weight distribution). We show that, asymptotically, aRS codes with nonconjugate evaluation points achieve the same length as PI codes. We also compute the permutation group of such aRS codes. We also extend the family of PI codes to consider arbitrary polynomial modules (not necessarily pairwise coprime), and study when these and general aRS codes satisfy the QMDS and dually QMDS properties.
ER  -