Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array (Q1104749)

From MaRDI portal
Revision as of 01:59, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
scientific article

    Statements

    Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array (English)
    0 references
    0 references
    1988
    0 references
    linear recurring relations
    0 references
    finite two-dimensional array
    0 references
    Berlekamp- Massey algorithm
    0 references
    linear feedback shift-register
    0 references
    complexity of computation
    0 references
    Gröbner bases
    0 references
    polynomial ideals
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references