Skip to main content
SpringerLink
Log in

A Generalization of the Massey-Ding Algorithm

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

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:

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

Search

Navigation