Difference between revisions of "ApCoCoA-1:CharP.GBasisF512"
From ApCoCoAWiki
(adding a description.) |
m (fixing formula) |
||
| Line 6: | Line 6: | ||
</syntax> | </syntax> | ||
<description> | <description> | ||
| − | This command computes a Groebner basis in the field <formula> \mathbb{F}_{512} = ( | + | This command computes a Groebner basis in the field <formula> \mathbb{F}_{512} = (\mathbb{Z}_{\setminus(2)} [x])_{\setminus(x^9 + x +1)}</formula>. It uses the ApCoCoA Server and the ApCoCoALib's class [[ApCoCoALib:RingF512|RingF512]]. |
The command's input is a an Ideal in a Ring over Z, where the elements 0,..., 511 represent the field's elements. Details on this representation can be found [[ApCoCoA:Representation_of_finite_fields|here]]. For short, the binary representation of the number represents the coefficient vector if the polynomial in the field, e.g. | The command's input is a an Ideal in a Ring over Z, where the elements 0,..., 511 represent the field's elements. Details on this representation can be found [[ApCoCoA:Representation_of_finite_fields|here]]. For short, the binary representation of the number represents the coefficient vector if the polynomial in the field, e.g. | ||
Revision as of 20:03, 30 March 2008
Char2.GBasisF512
computing a gbasis of a given ideal in <formula>\mathbb{F}_{512}</formula>
Syntax
$char2.GBasisF512(Ideal):List
Description
This command computes a Groebner basis in the field <formula> \mathbb{F}_{512} = (\mathbb{Z}_{\setminus(2)} [x])_{\setminus(x^9 + x +1)}</formula>. It uses the ApCoCoA Server and the ApCoCoALib's class RingF512.
The command's input is a an Ideal in a Ring over Z, where the elements 0,..., 511 represent the field's elements. Details on this representation can be found here. For short, the binary representation of the number represents the coefficient vector if the polynomial in the field, e.g.
<formula> 11 = 8 + 2 + 1 = 2^3 + 2^1 + 2^0</formula>
So the number <formula>11</formula> corresponds to the polynomial <formula>x^3 + x + 1</formula>.
See also
