Hello, I am trying to implement Patterson's Algorithm for decoding Goppa codes.
I am stuck in the part that I have to find two polynomials a(x) and b(x) so that a(x)=b(x)R(x)mod(g(x)) where g(x) is the goppa poly and deg(a(x)) must be <= t/2. I know that i have to use extended Euclidean Algorithm and i have decoded several random examples but i can't find a general solution for any given equation. P.S. A paper i advised proposed the following code: (d,u,v) = xgcd(PR(1),PR(R.list())); #Where PR is a polynomial ring over an extension of GF(2) a = g*u; b = g*v; But I don't think is working correctly in the way i implemented it! Thanks in advance! -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
