Florent Chabaud
BACK
GF(2)
GF(3)
GF(5)
GF(7)
GF(p)
Index
PIPS

Polynomials over Galois Fields

All these polynomials are NOT guaranteed to be irreducible nor primitive. If you use some of these results, check their mathematical property before use... and it would be nice to make credit to this site also ;-)

GF(2) Here are tables of irreducible and primitive polynomials over binary field GF(2).
GF(3) Here are tables of irreducible polynomials over ternary field GF(3).
GF(5) Here are tables of irreducible polynomials over field GF(5).
GF(7) Here are tables of primitive polynomials over field GF(7).
GF(p) Thanks to Malcolm Greig, here is a table of primitive polynomials for building GF(pn) for all pn up to 230, with n > 1.
PIPS In order to present ZEN functionnalities, I have created a server that computes irreducible and primitive polynomials on demand.
BACK
GF(2)
GF(3)
GF(5)
GF(7)
GF(p)
Index
PIPS

Florent Chabaud
E-mail : florent.chabaud@m4x.org
Clé GPG : CLÉ