Complexities of self-dual normal bases
From MaRDI portal
Abstract: The complexities of self-dual normal bases, which are candidates for the lowest complexity basis of some defined extensions, are determined with the help of the number of all but the simple points in well chosen minimal Besicovitch arrangements. In this article, these values are first compared with the expected value of the number of all but the simple points in a minimal randomly selected Besicovitch arrangement in F d 2 for the first 370 prime numbers d. Then, particular minimal Besicovitch arrangements which share several geometrical properties with the arrangements considered to determine the complexity will be considered in two distinct cases.
Recommendations
- Construction of self-dual normal bases and their complexity
- On the complexity of the dual bases of the Gaussian normal bases
- Normal and Self-Dual Normal Bases from Factorization of $cx^{q + 1} + dx^q - ax - b$
- On the complexity of the dual basis of a type I optimal normal basis
- Selfdual normal bases on \(\mathrm{GF}(q)\)
Cites work
- A Wieferich prime search up to \(6.7 \times 10^{15}\)
- An analysis of variance test for normality (complete samples)
- Construction of self-dual normal bases and their complexity
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
- Handbook of finite fields
- scientific article; zbMATH DE number 424718 (Why is no real title available?)
- scientific article; zbMATH DE number 607286 (Why is no real title available?)
- scientific article; zbMATH DE number 1082456 (Why is no real title available?)
- scientific article; zbMATH DE number 204179 (Why is no real title available?)
- scientific article; zbMATH DE number 5058453 (Why is no real title available?)
- Low complexity normal bases
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
- On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\)
- On the complexity of the dual basis of a type I optimal normal basis
- Optimal normal bases
- Optimal normal bases in \(GF(p^ n)\)
- Regression. Theory and applications.
- Selfdual normal bases on \(\mathrm{GF}(q)\)
- The trace of an optimal normal element and low complexity normal bases
Cited in
(3)
This page was built for publication: Complexities of self-dual normal bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4992887)
