Recurrent methods for constructing irreducible polynomials over \(\text{GF}(2^s)\)
From MaRDI portal
Publication:1604418
DOI10.1006/ffta.2001.0323zbMath1028.11073MaRDI 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 polynomials; extension fields; composite finite fields; self-dual polynomials; Varshamov operator
11Y16: Number-theoretic algorithms; complexity
12E05: Polynomials in general fields (irreducibility, etc.)
11T06: Polynomials over finite fields
Related Items
Unnamed Item, Recursive construction of normal polynomials over finite fields, A note on N-polynomials over finite fields, Fixed points of the sum of divisors function on \({{\mathbb{F}}}_2[x\)], Construction of irreducible polynomials over finite fields, Constructions of irreducible polynomials over finite fields with even characteristic, Iterated constructions of irreducible polynomials over finite fields with linearly independent roots, Recursive constructions of N-polynomials over \(\text{GF}(2^s)\), Factors of Dickson polynomials over finite fields., Recurrent methods for constructing irreducible polynomials over \(\mathbb F_{q}\) of odd characteristics., Irreducible compositions of polynomials over finite fields of even characteristic, Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields, Explicit theorems on generator polynomials, On an iterated construction of irreducible polynomials over finite fields of even characteristic by Kyuregyan, Enumeration of a special class of irreducible polynomials in characteristic 2
Cites Work
