On irreducible polynomials of certain types in finite fields

From MaRDI portal
Publication:5569216

DOI10.1017/S0305004100045023zbMath0177.06601OpenAlexW2115443122MaRDI QIDQ5569216

Stephen D. Cohen

Publication date: 1969

Published in: Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0305004100045023




Related Items (37)

Recursive construction of normal polynomials over finite fieldsUnnamed ItemComposed products and factors of cyclotomic polynomials over finite fieldsConstruction of irreducible polynomials using cubic transformationPrescribing coefficients of invariant irreducible polynomialsEnumeration of self-reciprocal irreducible monic polynomials with prescribed leading coefficients over a finite fieldGeneralizations of self-reciprocal polynomialsIrreducible compositions of polynomials over finite fields of even characteristicOn the typical rank of elliptic curves over \(\mathbb{Q}(T)\)Factorization of a class of composed polynomialsThe action of \(\mathrm{GL}_2(\mathbb{F}_q)\) on irreducible polynomials over \(\mathbb{F}_q\), revisitedConstructions of irreducible polynomials over finite fields with even characteristicConstructing irreducible polynomials recursively with a reverse composition methodNew estimates and existence results about irreducible polynomials and self-reciprocal irreducible polynomials with prescribed coefficients over a finite fieldSelf-reciprocal irreducible polynomials with prescribed coefficientsOn the reducibility of some composite polynomials over finite fieldsRecursive constructions of irreducible polynomials over finite fieldsGeneralization of a theorem of CarlitzIrreducible compositions of polynomials over finite fieldsRecursive constructions of k-normal polynomials using some rational transformations over finite fieldsOn the parity of the number of irreducible factors of self-reciprocal polynomials over finite fieldsConstruction of primitive polynomials over finite fieldsIterated constructions of completely normal polynomialsThe explicit construction of irreducible polynomials over finite fieldsOn the action of \(\text{GL}_2(\mathbb F_q)\) on irreducible polynomials over \(\mathbb F_q\)On the construction of irreducible self-reciprocal polynomials over finite fieldsModular composition via factorizationPrimitive Polynomials Over Finite FieldsConstruction of irreducible polynomials through rational transformationsA note on the stability of trinomials over finite fieldsOn the construction of irreducible and primitive polynomials from \(\mathbb{F}_{q^m} [x\) to \(\mathbb{F}_q [x]\)] ⋮ Irreducible polynomials from a cubic transformationNewly reducible polynomial iteratesEnumeration of linear transformation shift registersFixed 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




This page was built for publication: On irreducible polynomials of certain types in finite fields