Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

FFA
2010

favoriteEmaildiscussreport

84views more FFA 2010»

Generating series for irreducible polynomials over finite fields

13 years 3 months ago

Generating series for irreducible polynomials over finite fields

Download math.univ-lille1.fr

We count the number of irreducible polynomials in several variables of a given degree over a ﬁnite ﬁeld. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the case of the multi-degree and the case of indecomposable polynomials.

Arnaud Bodin

Real-time Traffic

Exact Formula | FFA 2010 | Irreducible Polynomials | ﬁnite ﬁeld |

claim paper

Related Content

» Distribution of irreducible polynomials of small degrees over finite fields

» Fast Construction of Irreducible Polynomials over Finite Fields

» Parity of the number of irreducible factors for composite polynomials

» Irreducibility testing over local fields

» LowComplexity BitParallel Square Root Computation over GF2m for All Trinomials

» The 2Adic CM Method for Genus 2 Curves with Application to Cryptography

» Pseudorandom generators for CC0p and the Fourier spectrum of lowdegree polynomials over fi...

» Checking Polynomial Identities over any Field Towards a Derandomization

» Constructing Tower Extensions of Finite Fields for Implementation of PairingBased Cryptogr...

Post Info
More Details (n/a)

Added	25 Jan 2011
Updated	25 Jan 2011
Type	Journal
Year	2010
Where	FFA
Authors	Arnaud Bodin

Comments (0)