AI & ML
On MRD constacyclic codes over inseparable field extensions
arXiv math.IT0 views
arXiv:2610.23459v1 Announce Type: new Abstract: In this paper, we construct MRD constacyclic codes of length $p$ over an inseparable field extension $L/K$, where $K$ has characteristic $p$. In particular, these codes cannot be obtained from known constructions.
Source：https://arxiv.org/abs/2610.23459PreviousA Generalized Half-Singleton Bound for List Decoding of Insertion/Deletion ErrorsNextSpatial Distribution of Mean PAoI in LEO Satellite-enabled IoT Networks
Related posts
The Autonomous Edge — Issue #13: Cheaper Agents, Harder Governance (Week of November 2, 2026)
0dev.to AI
Plano Físico vs Plano Funcional en AWS Networking: cómo los arquitectos senior resuelven lo que otros no ven
0dev.to AWS
We built Origami Tutor: free paper-craft lessons you can turn and replay in 3D
0dev.to WebDev
From two authorized photos to a short AI rap video (consent-first workflow)
0dev.to WebDev
Check a File Hash in the Browser, Without Uploading the File
0dev.to WebDev
Your AI keys were leaked at a platform. A local guard you can paste catches the abuse before the invoice.
0dev.to Security