Sequences of binary irreducible polynomials
Abstract
In this paper we construct an infinite sequence of binary irreducible polynomials starting from any irreducible polynomial f0 ∈ 2 [x]. If f0 is of degree n = 2l · m, where m is odd and l is a non-negative integer, after an initial finite sequence of polynomials f0, f1, ..., fs with s ≤ l+3, the degree of fi+1 is twice the degree of fi for any i ≥ s.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.