A fast algorithm for determining the minimal polynomial of \(up^n\)-periodic sequence (Q4926672)
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: A fast algorithm for determining the minimal polynomial of up^n-periodic sequence |
scientific article; zbMATH DE number 6178902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for determining the minimal polynomial of \(up^n\)-periodic sequence |
scientific article; zbMATH DE number 6178902 |
Statements
20 June 2013
0 references
minimal polynomial
0 references
linear complexity
0 references
periodic sequence
0 references
0.9262508153915404
0 references
0.891708254814148
0 references
0.8692054748535156
0 references
0.8652708530426025
0 references
