On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan

DOI10.1007/S10587-016-0253-2MaRDI QIDQ2810171zbMATH OpenOpenAlexFDO

Authors Simone Ugolini

Publication date 31 May 2016

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.7564, http://hdl.handle.net/10338.dmlcz/144889

zbMATH Keywords

finite fieldirreducible polynomialiterative construction

Mathematics Subject Classification ID

Polynomials (irreducibility, etc.) (11R09) Arithmetic theory of polynomial rings over finite fields (11T55) Polynomials in general fields (irreducibility, etc.) (12E05)

Abstract: In this paper we deal with the construction of sequences of irreducible polynomials with coefficients in finite fields of even characteristic. We rely upon a transformation used by Kyuregyan in 2002, which generalizes the $Q$-transform employed previously by Varshamov and Meyn for the synthesis of irreducible polynomials. While in the iterative procedure described by Kyuregyan the coefficients of the initial polynomial of the sequence have to satisfy certain hypotheses, in the present paper we construct infinite sequences of irreducible polynomials of non-decreasing degree starting from any irreducible polynomial.

Recommendations

• Sequences of binary irreducible polynomials
• scientific article; zbMATH DE number 26837
• Construction of irreducible polynomials using cubic transformation
• Sequences of irreducible polynomials without prescribed coefficients over odd prime fields
• A recurrent construction of irreducible polynomials of fixed degree over finite fields
• Newly reducible polynomial iterates
• Recursive construction of normal polynomials over finite fields
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• On the construction of irreducible self-reciprocal polynomials over finite fields
• Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)

Cites work

• Graphs associated with the map \(x\mapsto x+x^{-1}\) in finite fields of characteristic two
• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• On the construction of irreducible self-reciprocal polynomials over finite fields
• Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
• Sequences of binary irreducible polynomials
• Sequences of irreducible polynomials without prescribed coefficients over odd prime fields
• The explicit construction of irreducible polynomials over finite fields

Cited in

(3)

• Iterated constructions of irreducible polynomials over finite fields with linearly independent roots
• scientific article; zbMATH DE number 4150334 (Why is no real title available?)
• On the construction of irreducible polynomials over finite fields via odd prime degree endomorphisms of elliptic curves

This page was built for publication: On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan

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