Can't you regard the coefficients as a LFSR and then use the connection polynomial? I'm not saying that there is no work to be done, but I think the hardest part, the Berlekamp-Massey algorithm, is implemented.
http://www.sagemath.org/doc/reference/sage/crypto/lfsr.html On Thu, Jun 24, 2010 at 8:21 PM, John Cremona <john.crem...@gmail.com> wrote: > I have a power series f(x) in F[[x]] (where F is a finite field) which > I know to be a rational function p(x)/q(x) where p,q in F[x] have > degree at most n, and I want to find p and q. There is an algorithm > for this, like "rational reconstruction" to go from a real to a > rational using continued fraction. > > I could not find this implemented though there are quite a lot of > power series utilities and I might not recognise this if it has an > unfamiliar name. > > Does any one know if it is implemented? > > John Cremona > > -- > To post to this group, send email to sage-support@googlegroups.com > To unsubscribe from this group, send email to > sage-support+unsubscr...@googlegroups.com > For more options, visit this group at > http://groups.google.com/group/sage-support > URL: http://www.sagemath.org > -- To post to this group, send email to sage-support@googlegroups.com To unsubscribe from this group, send email to sage-support+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
