Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array (Q1104749)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array |
scientific article; zbMATH DE number 4057003
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array |
scientific article; zbMATH DE number 4057003 |
Statements
Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array (English)
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
0 references
0.9107845425605774
0 references
