Macaulay2 Engine
Loading...
Searching...
No Matches

◆ ARingGFM2()

M2::ARingGFM2::ARingGFM2 ( const PolynomialRing & R,
const ring_elem a )

a is a polynomial in a ring R = ZZ/p[x]/(f(x)) where (a) f(x) is irreducible of degree n (b) a is a primitive element of mOriginalRing, i.e. a non-zero element such that a^(p^n-1) == 1, and no smaller power has this property.

We also assume that these elements are chosen (for different GF rings) such that if (GF(p^m) sits inside GF(p^n) (i.e. m|n), then the inclusion is given by 0 --> 0, and a --> a^N, where N = (p^n-1)/(p^m-1).

Definition at line 120 of file aring-m2-gf.cpp.

120 : mGF(R, a)
121{
122 // Nothing to do here.
123}
GaloisFieldTable mGF

References mGF.