Metraipolis › archive › dc_2e04b625db39

Good rational functions up to degree six — arXiv:2611.03368

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.03368
License (as archived)
CC0-1.0
Archived
2026-11-03T11:39:18.626Z
SHA-256 of the archived text
c342c9c3a71e8aa51cd14dfe58ad23c105650cede55799af0d3a188d653d65cc
Stable URL of this page
https://metraipolis.com/documento/dc_2e04b625db39

How to cite

Good rational functions up to degree six — arXiv:2611.03368 — arXiv (en), https://arxiv.org/abs/2611.03368 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2e04b625db39 (Metraipolis archive dc_2e04b625db39, sha256 c342c9c3a71e8aa51cd14dfe58ad23c105650cede55799af0d3a188d653d65cc)
BibTeX
@misc{dc2e04b625db39,
  title = {Good rational functions up to degree six — arXiv:2611.03368},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.03368},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2e04b625db39; sha256 c342c9c3a71e8aa51cd14dfe58ad23c105650cede55799af0d3a188d653d65cc},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03368. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Locally recoverable codes (LRCs) are fundamental to the architecture of modern distributed storage systems. The Tamo-Barg construction of optimal LRCs was revolutionized by the introduction of good polynomials, which group evaluation points into local recovery sets. However, polynomial constructions are constrained by their inherently large Galois groups, which limit the number of totally split rational places. Recent advances have generalized this paradigm to good rational functions, which leverage the geometry of the projective line to achieve minimal Galois groups and subsequently codes with greater length. In this paper, we complete the classification of good rational functions of degree up to $6$ in characteristic $2$. By embedding the problem into algebraic function field theory, we explicitly determine the minimal arithmetic and geometric Galois groups for these low degrees. Furthermore, we move beyond asymptotic Hasse-Weil estimates by proving that the exact number of totally split places over extension fields obeys a linear recurring sequence (LRS). This gives an efficient method for computing the exact lengths and dimensions of the corresponding optimal LRCs and, in many cases, yields parameters beyond those obtainable from good polynomials.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT) ; Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2611.03368 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:05:37.202Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).