login
A071643
Optimal Hamming complexity of normal basis for GF(2^n) over GF(2).
0
3, 5, 7, 9, 11, 19, 21, 17, 19, 21, 23, 45, 27, 45, 85, 81, 35, 117, 63, 95, 63, 45, 105, 93, 51, 141, 55, 57, 59, 237, 361, 65
OFFSET
2,1
REFERENCES
M. Olofsson, VLSI Aspects on Inversion in Finite Fields, Dissertation No. 731, Dept. Elect. Engin., Linkoping, Sweden, 2002.
W. Geiselmann, Algebraische Algorithmenentwicklung am Beispiel der Arithmetik in endlichen Koerpern, Ph. D. Thesis, Univ. Karlsruhe, 1993.
CROSSREFS
Sequence in context: A143447 A318777 A152484 * A039578 A033032 A103148
KEYWORD
nonn
AUTHOR
N. J. A. Sloane Jun 22 2002
STATUS
approved