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
Razorpay webhook not verified: anyone can fake a payment
0dev.to
From FAQPage Schema to Answerable AI Documentation
0dev.to
Wiring Android's MediaPipe LLM Inference API to a Multi-Turn Conversation Engine
0dev.to
What Is LLM Throughput? Tokens per Second, Concurrency, and Batching
0dev.to
Diese Woche haben mir zwei Tools etwas vorgeschlagen und es direkt abgeschickt.
0dev.to
AI Agent Observability: What to Log Before Production
0dev.to