Hello, this is my first post to the list. I am trying to use B/M algo included in Sage. Now,
berlekamp_massey([GF(2)(0),0,1,0,1,0,0,1,0,1,1,1,0,0,1,1,0,0,0,0,1,0,1,1,0,1,0,1,0,0,0,1,1,1,1,0]) evals to f(x)=x^5 + x^3 + x^2 + x + 1 which is the minimal poly. Also, I know that when I take the reciprocal (x^5*f(1/x)), I find g(x)=x^5+x^4+x^3+x^2+1 which is the connection poly. of this LFSR. My question is how can I regenerate this sequence using this connection poly.? Providing initial states 0,0,1,0,1 yields to another sequence: (0 0 1 0 1 1 0 1 0 1 0 0 0 1 1 1 0 1 1 1 1 1 0 0 1 0 0 1 1 0 0) I've tried several different approaches but got no luck. -- Thank you, evrim. -- 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 http://groups.google.com/group/sage-support?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
