Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array (Q1104749): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3714165 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A theory of two-dimensional cyclic codes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Shift-register synthesis and BCH decoding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Impulse response arrays of discrete-space systems over a finite field / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: General theory of doubly periodic arrays over an arbitrary finite field and its applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals / rank | |||
Normal rank | |||
Latest revision as of 16:49, 18 June 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
0 references
