Sequences of binary irreducible polynomials
From MaRDI portal
Abstract: In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial . If is of degree , where is odd and is a non-negative integer, after an initial finite sequence of polynomials with , the degree of is twice the degree of for any .
Recommendations
- Sequences of irreducible polynomials without prescribed coefficients over odd prime fields
- Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
- Transformations on irreducible binary polynomials
- A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields
- Sequences of reducible \(\{0,1\}\)-polynomials modulo a prime
Cites work
Cited in
(12)- On the construction of irreducible polynomials over finite fields via odd prime degree endomorphisms of elliptic curves
- Construction of irreducible polynomials through rational transformations
- Sequences of irreducible polynomials without prescribed coefficients over odd prime fields
- On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan
- Transformations on irreducible binary polynomials
- Irreducible polynomials and barker sequences
- scientific article; zbMATH DE number 3893217 (Why is no real title available?)
- The adjacency matrix of some class of irreducible polynomials
- Sequences of reducible \(\{0,1\}\)-polynomials modulo a prime
- Constructing irreducible polynomials recursively with a reverse composition method
- Characterization for a family of infinitely many irreducible equally spaced polynomials
- Sequences of binomial type with polynomial coefficients
This page was built for publication: Sequences of binary irreducible polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q393938)