arXiv · 1007.4899
Construction of self-dual normal bases and their complexity
Abstract
Recent work of Pickett has given a construction of self-dual normal bases for extensions of finite fields, whenever they exist. In this article we present these results in an explicit and constructive manner and apply them, through computer search, to identify the lowest complexity of self-dual normal bases for extensions of low degree. Comparisons to similar searches amongst normal bases show that the lowest complexity is often achieved from a self-dual normal basis.
Explore related subjects
Keep this discovery
François Arnault, Erik Jarl Pickett, Stéphane Vinatier. 2011-05-06. Construction of self-dual normal bases and their complexity. https://doi.org/10.1016/j.ffa.2011.10.002
Cite the original work for its findings. Save a collection to share your selection of sources.