AI & ML
Semifields and rank-metric codes from Drinfeld modules
arXiv math.IT0 views
arXiv:2601.03653v3 Announce Type: replace-cross Abstract: We establish a connection between Drinfeld modules and rank-metric codes, focusing on maximum rank distance codes arising from finite semifields. Our method constructs rank-metric codes from linear subspaces of endomorphisms of a Drinfeld module acting on torsion submodules. Using a duality between a Drinfeld module and its endomorphisms, we show that Sheekey's construction fits naturally into this framework, yielding a short conceptual proof of his main theorem. Next, to demonstrate the potential of our method, we construct, for every prime power $q$, new semifields of order $q^9$, which are distinguished from the known ones by their nuclear parameters. Finally, going beyond the Drinfeld module $\phi_T=\tau^n$ that underlies Sheekey's and related constructions, we obtain infinite families of semifield codes from Drinfeld modules with smaller endomorphism rings, and show that the corresponding semifields are cyclic semifields of Petit.
Source:https://arxiv.org/abs/2601.03653PreviousA slightly improved upper bound for quantum statistical zero-knowledgeNextMinimum Neural Weight Norm = Kolmogorov Complexity
Related posts
Ruby2ßhell: Pre-authentication RCE on stock Rails
0Hacker News
Generalizing self-normalized importance sampling with couplings
0arXiv stat.CO
Bayesian Computation of Copula-based Multivariate Models with an Application to Doping Detection
0arXiv stat.CO
WAIVES: Weak-form Asymptotically-unbiased Instrumental-Variable Estimation for SDEs
0arXiv stat.CO
Treat Your Honeypot Analysis Like Code: Git, Pull Requests and a Human Gate for AI [Guest Diary], (Wed, Nov 18th)
0SANS ISC
ISC Stormcast For Thursday, November 19th, 2026 https://isc.sans.edu/podcastdetail/10186, (Thu, Nov 19th)
0SANS ISC