Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (Q1008964)
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: Reducing the calculation of the linear complexity of uā^v-periodic binary sequences to Games-Chan algorithm |
scientific article; zbMATH DE number 5536694
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm |
scientific article; zbMATH DE number 5536694 |
Statements
Reducing the calculation of the linear complexity of \(u_2^v\)-periodic binary sequences to Games-Chan algorithm (English)
0 references
31 March 2009
0 references
0 references
0 references
0 references
0.8963481
0 references
0.8944482
0 references
0.89227307
0 references
0 references
0.8919316
0 references
0.89149463
0 references
0.88425803
0 references
0.8768332
0 references
0.87590593
0 references
