Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array (Q1104749): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:59, 31 January 2024
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
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
