New recursive construction of normal polynomials over finite fields

DOI10.1090/CONM/632/12614MaRDI QIDQ3187277zbMATH OpenOpenAlexFDO

Authors Sergey Abrahamyan, Melsik K. Kuyregyan

Publication date 2 September 2016

Published in Topics in Finite Fields (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/conm/632/12614

zbMATH Keywords

composition methodnormal polynomials

Mathematics Subject Classification ID

Polynomials over finite fields (11T06)

Recommendations

• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• Recursive construction of normal polynomials over finite fields
• Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)
• A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
• Specific irreducible polynomials with linearly independent roots over finite fields

Cited in

(8)

• Explicit N-polynomials of 2-power degree over finite fields. I
• Some algorithms for normality testing irreducible polynomials and computing complexity of the normal polynomials over finite fields
• scientific article; zbMATH DE number 4065122 (Why is no real title available?)
• Recursive construction of normal polynomials over finite fields
• Construction of self-reciprocal normal polynomials over finite fields of even characteristic
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• An approach to normal polynomials through symmetrization and symmetric reduction
• Recursive constructions of N-polynomials over \(\text{GF}(2^s)\)

This page was built for publication: New recursive construction of normal polynomials over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187277)