Trace- and norm-compatible extensions of finite fields

DOI10.1007/BF01268660zbMath0768.12005MaRDI QIDQ1205131

Alfred Scheerhorn

Publication date: 1 April 1993

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

algorithmfinite fieldsnormal basesprimitive elementscomputation of trace- compatible polynomialsextension fieldsnorm-compatibilitytrace- compatibility

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite fields (field-theoretic aspects) (12E20) Field extensions (12F99)

Related Items (2)

Explicit N-polynomials of \(2\)-power degree over finite fields. I ⋮ New algorithms for generating Conway polynomials over finite fields

Cites Work

• Unnamed Item
• Unnamed Item
• On the construction of irreducible self-reciprocal polynomials over finite fields
• Constructing normal bases in finite fields
• Bases for finite fields and a canonical decomposition for a normal basis generator
• Infinite Algebraic Extensions of Finite Fields
• Primitive Normal Bases for Finite Fields

This page was built for publication: Trace- and norm-compatible extensions of finite fields