# Difference between revisions of "ApCoCoA-1:CharP.GBasisF64"

(Description update.) |
|||

Line 8: | Line 8: | ||

<em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. | <em>Please note:</em> The function(s) explained on this page is/are using the <em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. | ||

<par/> | <par/> | ||

− | This command computes a Groebner basis in the field | + | This command computes a Groebner basis in the field F_64 = (Z/(2))[x]/(x^6 + x + 1). |

<itemize> | <itemize> |

## Revision as of 10:47, 28 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 F_64 = (Z/(2))[x]/(x^6 + x + 1).

@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