arXiv (All)
open access
Support-Primitive Decomposition of Constacyclic Codes over Finite Fields: Coefficients-Based and Roots-Based Descriptions
Let $\mathcal C=(f)$ be a $λ$-constacyclic code over $\mathbb F_q$, where $f(X)$ is a monic factor of $X^N-λ$ with nonzero constant term. We introduce the support period $\operatorname{sp}(f)$ of $f(X)$, and define its support-primitive core $f_{\mathrm{sp}}(X)$ as the unique support-primitive polyn
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
- The spectral relation between irreducible cyclic codes and generalized Paley graphs#1076203
- Fast Deterministic Normal Bases and Circulant Polynomial Determinants#1118631
- SIC dimension towers via cyclotomic polynomials#927721
- On the computation of the canonical basis for irreducible highest weight $U_q (\mathfrak{gl}_{\infty})$-module#635729
- On the computation of the canonical basis for irreducible highest weight $U_q (\mathfrak{gl}_{\infty})$-module#633380
Record · ID 1062309
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