A General Construction of Codes from Drinfeld Modules
Alessandro Giannoni, Giacomo Micheli, Mihran Papikian
Source 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 in characteristic of degree , the stabilization formula for morphism spaces yields rank-metric codes of -dimension and minimum distance , where . Simultaneous restriction to distinct degree- torsion modules gives additive sum-rank codes of the same dimension and minimum distance at least . Their normalized Singleton defects tend to zero, while in characteristic the module 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 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.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.