Skip to content
Research Article Open access CC BY 4.0

Construction and Determination of Irreducible Polynomials in Galois elds, GF(2m)

Abraham Aidoo, Kwasi Baah Gyam, Fengfan Yang

Journal of Advances in Mathematics and Computer Science · pp. 1–6 · Published 3 Aug 2019

10.9734/jamcs/2019/v33i330181

Abstract

This work is about Construction of Irreducible Polynomials in Finite fields. We defined some terms in the Galois field that led us to the construction of the polynomials in the GF(2m). We discussed the following in the text; irreducible polynomials, monic polynomial, primitive polynomials, eld, Galois eld or nite elds, and the order of a finite field. We found all the polynomials in $$F_2[x]$$ that is, $$P(x) =\sum_{i=1}^m a_ix^i : a_i \in F_2$$ with $$a_m \neq 0$$ for some degree $m$ which led us to determine the number of irreducible polynomials generally at any degree in $$F_2[x]$$.

Irreducible polynomials field finite fields.

Cited by 0

No indexed citations yet.

Article metrics

Real usage data collected on this platform.

0

Page views

0

PDF downloads

0

Outbound clicks

0

Citations

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

No views recorded yet.

Traffic sources

Referring site, by host.

No traffic recorded yet.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.