A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields

DOI10.1007/978-3-642-23568-9_1MaRDI QIDQ3090887zbMATH OpenOpenAlexFDO

Authors Sergey Abrahamyan, Melsik K. Kuyregyan

Publication date 2 September 2011

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23568-9_1

zbMATH Keywords

finite fieldpolynomial compositionrecurrent method

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• A recurrent construction of irreducible polynomials of fixed degree over finite fields
• Recursive constructions of irreducible polynomials over finite fields
• scientific article; zbMATH DE number 3897066
• scientific article; zbMATH DE number 4146067
• scientific article; zbMATH DE number 26837
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics
• Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics.
• Constructing irreducible polynomials over finite fields
• Construction of Irreducible Polynomials over Finite Fields

Cited in

(26)

• Sequences of binary irreducible polynomials
• Constructing irreducible polynomials recursively with a reverse composition method
• A Formula that Produces All, and Nothing But, Irreducible Polynomials in Z_p[x]
• Irreducible compositions of degree two polynomials over finite fields have regular structure
• scientific article; zbMATH DE number 220087 (Why is no real title available?)
• Recursive constructions of \(k\)-normal polynomials using some rational transformations over finite fields
• Irreducible polynomials over finite fields produced by composition of quadratics
• On the reducibility of some composite polynomials over finite fields
• Irreducible compositions of polynomials over finite fields
• Recursive constructions of irreducible polynomials over finite fields
• A recurrent construction of irreducible polynomials of fixed degree over finite fields
• Construction of irreducible polynomials through rational transformations
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics
• On the irreducibility of some composite polynomials
• A new direction on constructing irreducible polynomials over finite fields
• Irreducible compositions of polynomials over finite fields of even characteristic
• On sets of irreducible polynomials closed by composition
• A note on identification of irreducible polynomials of over \(\mathbb F_{2}\)
• An iterative construction of irreducible polynomials reducible modulo every prime
• scientific article; zbMATH DE number 5733040 (Why is no real title available?)
• New recursive construction of normal polynomials over finite fields
• scientific article; zbMATH DE number 3897066 (Why is no real title available?)
• Recurrent methods for constructing irreducible polynomials over \(\mathbb F_q\) of odd characteristics. II
• Recursive construction of normal polynomials over finite fields
• Construction of irreducible polynomials over finite fields
• scientific article; zbMATH DE number 4146067 (Why is no real title available?)

This page was built for publication: A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields

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