Euclidean Algorithm for polynomials over a finite field

compute the gcd of a and b over GF(q):

type the polynomial as a string of coefficients, one character each. For example, the string 1011 denotes the polynomial X^4 + X + 1. Of course, we are restricted to fields of size at most 9 for this, since we allow only one digit per coefficient.




created by A. Betten, November 11, 2003, last change February 12, 2004