Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
From MaRDI portal
Publication:1604418
DOI10.1006/ffta.2001.0323zbMath1028.11073OpenAlexW2033273497MaRDI QIDQ1604418
Publication date: 4 July 2002
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/ffta.2001.0323
irreducible polynomialsextension fieldscomposite finite fieldsself-dual polynomialsVarshamov operator
Number-theoretic algorithms; complexity (11Y16) Polynomials in general fields (irreducibility, etc.) (12E05) Polynomials over finite fields (11T06)
Related Items (15)
Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields ⋮ Recursive construction of normal polynomials over finite fields ⋮ Unnamed Item ⋮ Iterated constructions of irreducible polynomials over finite fields with linearly independent roots ⋮ Irreducible compositions of polynomials over finite fields of even characteristic ⋮ Constructions of irreducible polynomials over finite fields with even characteristic ⋮ Enumeration of a special class of irreducible polynomials in characteristic 2 ⋮ Recursive constructions of N-polynomials over \(\text{GF}(2^s)\) ⋮ Factors of Dickson polynomials over finite fields. ⋮ On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan ⋮ A note on N-polynomials over finite fields ⋮ Explicit theorems on generator polynomials ⋮ Fixed points of the sum of divisors function on \({{\mathbb{F}}}_2[x\)] ⋮ Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics. ⋮ Construction of irreducible polynomials over finite fields
Cites Work
This page was built for publication: Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
