Introduction - If you have any usage issues, please Google them yourself
1.Realize, by using c/c++ or Matlab, the Euclidean algorithm to calculate the greatest common division (GCD) for arbitrary two polynomials over GF(2). Simulate and analyze the calculation of the GCD polynomial for two given polynomials with order no less than 5.