Papers
Topics
Authors
Recent
Search
2000 character limit reached

A General Construction of Codes from Drinfeld Modules

Published 1 Sep 2026 in math.NT, cs.IT, and math.CO | (2609.01484v1)

Abstract: 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 rr in characteristic p\mathfrak{p} of degree dd, the stabilization formula for morphism spaces yields rank-metric codes of Fq\mathbb{F}_q-dimension mrtcmrt-c and minimum distance rt+1r-t+1, where c=r(r1)(d1)/2c=r(r-1)(d-1)/2. Simultaneous restriction to \ell distinct degree-mm torsion modules gives additive sum-rank codes of the same dimension and minimum distance at least rt+1\ell r-t+1. Their normalized Singleton defects tend to zero, while in characteristic (T)(T) the module φT=τ<sup>rφ_T=τ<sup>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 mm 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.