arXiv (All)
open access
Code Equivalence and Automorphism Groups of Weighted Superelliptic Codes
We study permutation and monomial equivalence for one-point codes on weighted superelliptic curves. On strata where $H_m\simeq \Z/n\Z\times\Z/m\Z$ acts regularly on the evaluation set, we prove that these codes are Cartesian character codes and determine their primal and dual minimum distances. We c
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Edge codes constructed from unicyclic graphs#799611
- Factorization of some polynomials over finite local commutative rings and applications to certain self-dual and LCD codes#644394
- Cyclicity of Binary Group Codes.#1173
- New Constructions of Binary Cyclic Codes with Both Relatively Large Minimum Distance and Dual Distance#139149
- Generalized Rank Weight and Extended Generalized Poset Weight Defined For Codes Over Rings: A Galois Connection Approach#1216350
Record · ID 1200507
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive