Recurrent Methods for Constructing Irreducible Polynomials over GF(2 s )

Publisher： Elsevier

ISSN： 1071-5797

Source： Finite Fields and Their Applications, Vol.8, Iss.1, 2002-01, pp. : 52-68

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Irreducible polynomials over GF(2) with three prescribed coefficients

By Fitzgerald R.W. Yucas J.L.

Finite Fields and Their Applications, Vol. 9, Iss. 3, 2003-07 ,pp. : 286-299

Elsevier

Access to resources Recommend Favorite

Counting Irreducible Polynomials over Finite Fields Using the Inclusion-Exclusion Principle

By Chebolu Sunil K. Mináč Ján

Mathematics Magazine, Vol. 84, Iss. 5, 2011-12 ,pp. : 369-371

Mathematical Association of America

Access to resources Recommend Favorite

Number of Irreducible Polynomials in Several Variables over Finite Fields

By Bodin Arnaud

American Mathematical Monthly, Vol. 115, Iss. 7, 2008-08 ,pp. : 653-660

Mathematical Association of America

Access to resources Recommend Favorite

Polynomial Basis Multiplication over GF(2 m )

By Erdem Serdar

Acta Applicandae Mathematicae, Vol. 93, Iss. 1-3, 2006-09 ,pp. : 33-55

Springer Publishing Company

Access to resources Recommend Favorite

Generic polynomials for transitive subgroups of the group S 4 over fields of characteristic 2

By Sergeev A. Yakovlev A.

Journal of Mathematical Sciences, Vol. 140, Iss. 5, 2007-02 ,pp. : 742-747

Springer Publishing Company

Access to resources Recommend Favorite