A General Construction of Codes from Drinfeld Modules
Alessandro Giannoni, Giacomo Micheli, Mihran Papikian
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 r in characteristic p of degree d, the stabilization formula for morphism spaces yields rank-metric codes of Fq-dimension mrt-c and minimum distance r-t+1, where c=r(r-1)(d-1)/2. Simultaneous restriction to distinct degree-m torsion modules gives additive sum-rank codes of the same dimension and minimum distance at least r-t+1. Their normalized Singleton defects tend to zero, while in characteristic (T) the module ϕT=τ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.
Create a lesson
Related papers
A new proof that more than 2/3 of the zeros of the Riemann zeta function are simple and on the critical line
Youness Lamzouri
Petersson-Rigid Lattices in a Census of 100 Rank-Three Root Bases
Eungang Cho
Adelic points and unmramified Brauer approximation for classifying stacks
Ajneet Dhillon
On divergence related to Riemann--von Mangoldt's explicit formula of the prime-counting function
Harald Grobner
On the occurrence of congruence multiplicities between Ramanujan's theta functions
Shane Chern, Nicolas Allen Smoot, Dazhao Tang
Improved Weyl bounds on short intervals
Xiyu Hu