Construction of Irreducible Polynomials in Galois fields, GF(2m) Using Normal Bases
Abraham Aidoo, Kwasi Baah Gyam
Asian Research Journal of Mathematics · pp. 1–15 · Published 24 Jul 2019
10.9734/arjom/2019/v14i330131Abstract
This thesis is about Construction of Polynomials in Galois fields Using Normal Bases in finite fields. In this piece of work, we discussed the following in the text; irreducible polynomials, primitive polynomials, field, Galois field or finite fields, and the order of a finite field. We found the actual construction of polynomials in GF(2m) with degree less than or equal to m − 1 and also illustrated how this construction can be done using normal bases. Finally, we found the general rule for construction of GF(pm) using normal bases and even the rule for producing reducible polynomials.
Cited by 1
F. Tita, Adi Setiawan, Bambang Susanto · BAREKENG JURNAL ILMU MATEMATIKA DAN TERAPAN · 2024
Related research
- Screening of Brinjal Varieties for Resistance Against Blight Disease Caused by Alternaria alternata (Fr.) Keissler in Konkan Region of Maharashtra, India — shares topic coverage
- A Survey of Radiation Levels Associated with Exposure to Power-line in Some Selected Areas in Ibadan Metropolis, Oyo State, Nigeria — shares topic coverage
- Comparison of Methods for Saturated Hydraulic Conductivity Determination: Field, Laboratory and Empirical Measurements (A Pre-view) — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
1
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.