Computing the linear complexity for sequences with characteristic polynomial \(f^v\) (Q2392687)
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: Computing the linear complexity for sequences with characteristic polynomial f^v |
scientific article; zbMATH DE number 6194319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the linear complexity for sequences with characteristic polynomial \(f^v\) |
scientific article; zbMATH DE number 6194319 |
Statements
Computing the linear complexity for sequences with characteristic polynomial \(f^v\) (English)
0 references
2 August 2013
0 references
linear complexity
0 references
Games-Chan algorithm
0 references
linear recurrent sequences
0 references
0 references
0.8664494752883911
0 references
0.8407702445983887
0 references
0.837820827960968
0 references
