Metraipolis › archive › dc_df9bec89da9c

A General Construction of Codes from Drinfeld Modules — arXiv:2609.01484

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.01484
License (as archived)
CC0-1.0
Archived
2026-10-17T07:06:30.584Z
SHA-256 of the archived text
5dda8a0d0cc5a232ef35f7f9f5aafec53ab90b5f8073116df1042abea7ab2a18
Stable URL of this page
https://metraipolis.com/documento/dc_df9bec89da9c

How to cite

A General Construction of Codes from Drinfeld Modules — arXiv:2609.01484 — arXiv (en), https://arxiv.org/abs/2609.01484 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_df9bec89da9c (Metraipolis archive dc_df9bec89da9c, sha256 5dda8a0d0cc5a232ef35f7f9f5aafec53ab90b5f8073116df1042abea7ab2a18)
BibTeX
@misc{dcdf9bec89da9c,
  title = {A General Construction of Codes from Drinfeld Modules — arXiv:2609.01484},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.01484},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_df9bec89da9c; sha256 5dda8a0d0cc5a232ef35f7f9f5aafec53ab90b5f8073116df1042abea7ab2a18},
  year = {2026}
}

Archived text

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

We construct additive rank-metric and sum-rank-metric codes from Drinfeld modules by restricting bounded-degree morphisms to prime-to-characteristic torsion. For supersingular Drinfeld modules of rank $r$ in characteristic $\mathfrak{p}$ of degree $d$, the stabilization formula for morphism spaces yields rank-metric codes of $\mathbb{F}_q$-dimension $mrt-c$ and minimum distance $r-t+1$, where $c=r(r-1)(d-1)/2$. Simultaneous restriction to $\ell$ distinct degree-$m$ torsion modules gives additive sum-rank codes of the same dimension and minimum distance at least $\ell r-t+1$. Their normalized Singleton defects tend to zero, while in characteristic $(T)$ the module $\phi_T=\tau^r$ makes the defect vanish and produces an explicit MSRD family. We identify this family with a skew Chinese remainder theorem code supported on central skew polynomials and prove that its poly-skew weight is exactly $m$ times its sum-rank weight. This gives a specialized Singleton-type bound and a polynomial-time unique decoder up to the full sum-rank unique-decoding radius. We also derive a Welch-Berlekamp-type filter equation for the general supersingular sum-rank construction; it becomes an effective decoder whenever bases of the relevant morphism spaces and the restriction maps are computable.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-02 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Information Theory (cs.IT); Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.01484 — 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-10-17T06:52:59.723Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-02?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).