Hi, I am trying to work with polynomials in Finite Fields. We have to implement the Extended Euclidean Algorithm for using it with Reed Solomon Codes.
This is what I am trying to do: <pre> m = 4 k = 7 n = 2^m-1 f.<alpha> = FiniteField(2^m); f r(x) = 1+alpha*x+alpha^2*x^2+x^3+x^4+x^5+x^6+x^7+x^8+alpha^3*x^9+x^10+x^11+x^12+x^13+x^14; r Si = [r(alpha^i) for i in [1..8]]; Si S(x) = sum([Si[i]*x^(7-i) for i in [0..7]]); S t = floor((n-k)/2) q = n+1 P.<x> = PolynomialRing(Integers(q)) a = x^(2*t) b = S(x) </pre> Now my problem is that I would like to divide a by b and get bot the quotient and the reminder. All the documentation I have found online says that I have to write: <pre>a.quo_rem(b)</pre> But sage says that the method doesn't exist. Can you suggest me what I am missing? Thank you very much in advance, best regards. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
