TY - JOUR
T1 - A Generalization of the Massey-Ding Algorithm
AU - Althaler, Joachim
AU - Dür, Arne
PY - 1998/4
Y1 - 1998/4
N2 - 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.
AB - 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.
KW - Annihilator ideal
KW - Linear recurrence relation
KW - Minimal Gröbner basis
KW - Shift register synthesis problem
UR - http://www.scopus.com/inward/record.url?scp=0031681655&partnerID=8YFLogxK
U2 - 10.1007/s002000050092
DO - 10.1007/s002000050092
M3 - Article
VL - 9
SP - 1
EP - 14
JO - Applicable Algebra in Engineering, Communication and Computing 9,
JF - Applicable Algebra in Engineering, Communication and Computing 9,
IS - 1
ER -