A Generalization of the Massey-Ding Algorithm

Joachim Althaler, Arne Dür

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


The set of all linear recurrence relations satisfied by given sequences of finite length is described by the annihilator ideal of the sequences. The Massey-Ding algorithm to compute a linear recurrence relation of minimal order for several finite sequences of equal length is generalized to compute a minimal Gröbner basis of the annihilator ideal of several finite sequences of generally different lengths.

Original languageEnglish
Pages (from-to)1-14
Number of pages14
JournalApplicable Algebra in Engineering, Communication and Computing 9,
Issue number1
Publication statusPublished - Apr 1998


  • Annihilator ideal
  • Linear recurrence relation
  • Minimal Gröbner basis
  • Shift register synthesis problem


Dive into the research topics of 'A Generalization of the Massey-Ding Algorithm'. Together they form a unique fingerprint.

Cite this