Difference between revisions of "ApCoCoA-1:CharP.GBasisF64"
| Line 18: | Line 18: | ||
<seealso> | <seealso> | ||
<see>GBasis</see> | <see>GBasis</see> | ||
| + | <see>Introduction to Groebner Basis in CoCoA</see> | ||
<see>Char2.GBasisF2</see> | <see>Char2.GBasisF2</see> | ||
<see>Char2.GBasisF4</see> | <see>Char2.GBasisF4</see> | ||
| Line 32: | Line 33: | ||
<see>Representation of finite fields</see> | <see>Representation of finite fields</see> | ||
</seealso> | </seealso> | ||
| + | |||
| + | <types> | ||
| + | <type>cocoaserver</type> | ||
| + | <type>ideal</type> | ||
| + | <type>groebner</type> | ||
| + | </types> | ||
<key>GBasisF64</key> | <key>GBasisF64</key> | ||
Revision as of 15:21, 23 April 2009
Char2.GBasisF64
Computing a Groebner Basis of a given ideal in <formula>\mathbb{F}_{64}</formula>.
Syntax
Char2.GBasisF64(Ideal:IDEAL):LIST
Description
Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.
This command computes a Groebner basis in the field <formula> \mathbb{F}_{64} = (\mathbb{Z}_{\setminus(2)} [x])_{\setminus (x^6 + x + 1)}</formula>.
@param Ideal An Ideal in a Ring over Z, where the elements 0,...,63 represent the field's elements. For short, the binary representation of the number represents the coefficient vector if the polynomial in the field, e.g. 11 = 8 + 2 + 1 = 2^3 + 2^1 + 2^0. So the number 11 corresponds to the polynomial x^3 + x + 1.
@return A Groebner Basis of the given ideal.
See also
Introduction to Groebner Basis in CoCoA
Representation of finite fields
