I have the ore_algebra package now. I'm not satisfied with its interface,
nor with that of LSFR or its services.
The guess() and random_object() methods of my proposed class indeed do not
belong to such an object. That's why they are declared @static_method.
Yes, we need to avoid code duplication
One more remark: there is also a basic implementation of linear
recurrences with constant coefficients in sage.crypto.lfsr...
--
Marc
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from
I see now how powerful the ore algebra approach is. It is still unclear to
me if all polynomial fractions (even those >1) can be represented, which
would be prerequisite to represent recurrences with all possible initial
values.
Looking forward to ore_algebra. If that package link were available n
I'm leaning towards the operator kind of recurrence because I definitely
don't think about it as a sequence with specific length. But the core
object really is the ogf, i.e. the polynomial fraction which defines
everything in the same sense special function expressions are sufficient to
define all
Ralf Stephan wrote:
> Please make your comments on the design while it's baking.
>
> http://trac.sagemath.org/ticket/15714
Just some quick thoughts.
To me most of the features you suggest look like a special case of what
is already implemented in Manuel Kauers et al.'s ore_algebra package--
whi
