Complexities of self-dual normal bases
From MaRDI portal
Publication:4992887
DOI10.12697/ACUTM.2020.24.05zbMath1466.52025arXiv1708.00344MaRDI QIDQ4992887
Publication date: 10 June 2021
Published in: Acta et Commentationes Universitatis Tartuensis de Mathematica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.00344
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Selfdual normal bases on \(\mathrm{GF}(q)\)
- Construction of self-dual normal bases and their complexity
- Low complexity normal bases
- On the complexity of the dual basis of a type I optimal normal basis
- The trace of an optimal normal element and low complexity normal bases
- Optimal normal bases in \(GF(p^ n)\)
- Optimal normal bases
- On randomly chosen arrangements of \(q+1\) lines with different slopes in \(\mathbb{F}_q^2\)
- Handbook of Finite Fields
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
- An analysis of variance test for normality (complete samples)
- On a Test of Whether one of Two Random Variables is Stochastically Larger than the Other
