Open Access Open Access  Restricted Access Subscription or Fee Access

The Number of Irreducible Polynomials over a Finite Field : An Algebraic Proof

Ricky Aditya

Abstract


The concepts of finite field are used in coding theory, in which the finite field is the set of alphabets. To construct a finite field of order p^n, where p is a prime integer and n is a natural number, an irreducible polynomial of degree n over Z_p is needed. In this article, the number
of irreducible polynomial of degree n over Z_p is given and also proved using abstract algebra approach. Because the number is always positive, for any prime integer p and natural number n, an irreducible polynomial of degree n over Z_p always exists. Moreover, it implies that a finite field of order p^n always exists.

Keywords


Finite Fields, Irreducible Polynomials, Existence of Finite Fields.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.