Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

16

AAECC
1998
Springer

favoriteEmaildiscussreport

88views Algorithms» more AAECC 1998»

A Generalization of the Massey-Ding Algorithm

13 years 4 months ago

A Generalization of the Massey-Ding Algorithm

Download www.cs.ust.hk

The set of all linear recurrence relations satisﬁed by given sequences of ﬁnite length is described by the annihilator ideal of the sequences. The MasseyDing algorithm to compute a linear recurrence relation of minimal order for several ﬁnite sequences of equal length is generalized to compute a minimal Gro¨ bner basis of the annihilator ideal of several ﬁnite sequences of generally diﬀerent lengths.

Joachim Althaler, Arne Dür

Real-time Traffic

AAECC 1998 | Algorithms | Annihilator Ideal | Recurrence Relation | Sequences |

claim paper

Related Content

» Mining Frequent Generalized Itemsets and Generalized Association Rules Without Redundancy

» General Pseudorandom Generators from Weaker Models of Computation

» A new method for finding generalized frequent itemsets in generalized association rule min...

» Generalization Algorithms for SecondOrder Terms

» Exclusive Strategy for Generalization Algorithms in Microdata Disclosure

» A constrained optimization approach for an adaptive generalized subspace tracking algorith...

» A General Greedy Approximation Algorithm with Applications

» A Generalization of Hybrid LetPolymorphic Type Inference Algorithms

» Fast Parsing for Boolean Grammars A Generalization of Valiants Algorithm

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	AAECC
Authors	Joachim Althaler, Arne Dür

Comments (0)