arXiv (All)
open access
Code Equivalence and Automorphism Problems for Codes
We study the complexity of the Code Equivalence problem and show that it is polynomially equivalent to several computational automorphism problems for codes. These problems ask for the cardinality (ACOUNT), an orbit partition (APART), and a generating set (AGEN) for the permutation automorphism grou
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
- Cyclicity of Binary Group Codes.#1173
- Minimum Schubert Codewords and Second-Minimum Grassmann Codewords#974636
- NOETHER: A Constructive Framework for Metamorphic Pattern Discovery from Operator Algebras#200568
- Hulls, linear equivalence, and weighted superelliptic codes#1077927
- Towards self-verification in finite difference code generation#648509
Record · ID 1061122
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