A Generalization of the Massey-Ding Algorithm

Abstract.

 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.

Similar content being viewed by others

Decision Problems for Linear Recurrence Sequences

Chapter © 2013

On the Positivity Problem for Simple Linear Recurrence Sequences,

Chapter © 2014

Recurrence Relations, Succession Rules, and the Positivity Problem

Chapter © 2015

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

• Artificial Intelligence

Author information

Authors and Affiliations

1. Institut für Mathematik, Universität Innsbruck, Technikerstrasse 25, A-6020 Innsbruck, Austria, , , , , , AT

   Joachim Althaler & Arne Dür

Authors

1. Joachim Althaler
   View author publications

   You can also search for this author in PubMed Google Scholar

2. Arne Dür
   View author publications

   You can also search for this author in PubMed Google Scholar

Additional information

Received: January 31, 1997; revised version: September 2, 1997

Rights and permissions

Reprints and permissions

About this article

Cite this article

Althaler, J., Dür, A. A Generalization of the Massey-Ding Algorithm. AAECC 9, 1–14 (1998). https://doi.org/10.1007/s002000050092

Download citation

• Issue Date: April 1998

• DOI: https://doi.org/10.1007/s002000050092

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