Extended Euclidean Algorithm for polynomials over GF(2^m) (Scripts) Publisher's description
from Jaco Versfeld
Contains two functions.
Contains two functions. The one function computes the greatest common divisor (gcd) of two polynomials a(x) and b(x) over GF(2^m). The other function performs the extended Euclidean algorithm where two polynomials u(x) and v(x) is calculated in addition to the gcd of a(x) and b(x) such that gcd = u(x)a(x) + v(x)b(x).
System Requirements:MATLAB 7.5 (R2007b)
Program Release Status: New Release
Program Install Support: Install and Uninstall