A generalization of the Massey-Ding algorithm (Q1389143)

From MaRDI portal
Revision as of 19:17, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A generalization of the Massey-Ding algorithm
scientific article

    Statements

    A generalization of the Massey-Ding algorithm (English)
    0 references
    0 references
    0 references
    12 August 1998
    0 references
    In [Finite linear recurring sequences and homogeneous ideals, same journal 7, 377-390 (1996; Zbl 0870.11009)], the authors described the complete solution of the synthesis problem by computing a Gröbner basis of the annihilator ideal for a set of finite linear recurring sequences. In the present paper the authors use their ideal theoretic approach in order to generalize the Massey-Ding algorithm. The latter one computes a linear recurrence relation of minimal order for several finite sequences of equal length, while the generalization allows the computation of a minimal Gröbner basis of the annihilator ideal of several finite sequences of generally different lengths.
    0 references
    linear recurrence relation
    0 references
    shift register synthesis problem
    0 references
    annihilator ideal
    0 references
    minimal Gröbner basis
    0 references
    Massey-Ding algorithm
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references