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
How to Keep Chinese Model Inference In-Region: A Worked Cost Example
0dev.to

Ping64|The Visitor QR Code Someone Screenshotted and Forwarded to the Whole Group Chat
0dev.to
Building a Local Cyber Attack Simulation (Web UI Prototype)
0dev.to
AI Agents vs Python Scripts: What Should Beginner Developers Build First?
0dev.to
Your AI Coding Limits Ran Out Early? Find What Is Burning Them
0dev.to
Frontier Models Are Smarter Than Ever — So Why Do You Still Need a Swarm Harness Like VibesPlug?
0dev.to