arXiv (All)
open access
Fast Deterministic Normal Bases and Circulant Polynomial Determinants
Let $\mathsf{E}=\mathbb{F}_q[x]/(Γ)$ describe an algebraic extension of a finite field $\mathbb{F}_q$, where $q$ is a prime power and $Γ\in\mathbb{F}_q[x]$ is monic and irreducible of degree $n$. We give a deterministic algorithm that finds $β\in \mathsf{E}$ whose conjugates $β,β^q,\ldots,β^{q^{n-1}
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
- Constructions of complete permutations over $\mathbb{F}_q^n$#972621
- The fields generated by character values of linear and unitary groups#1129780
- Support-Primitive Decomposition of Constacyclic Codes over Finite Fields: Coefficients-Based and Roots-Based Descriptions#1062309
- A nowhere-zero point for several linear mappings simultaneously#1013667
- Bernstein-type bases on $q$-quadratic lattices and Askey--Wilson\slash $q$-Racah connection coefficients#1048763
Record · ID 1118631
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