Sciweavers

AAECC
1998
Springer
88views Algorithms» more  AAECC 1998»
14 years 5 days ago
A Generalization of the Massey-Ding Algorithm
The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compu...
Joachim Althaler, Arne Dür