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.
|Number of pages||14|
|Journal||Applicable Algebra in Engineering, Communication and Computing 9,|
|Publication status||Published - Apr 1998|
- Annihilator ideal
- Linear recurrence relation
- Minimal Gröbner basis
- Shift register synthesis problem