A fast algorithm for determining the linear complexity in periodic sequences (Q5455613)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5260284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for determining the linear complexity in periodic sequences |
scientific article; zbMATH DE number 5260284 |
Statements
4 April 2008
0 references
crytography
0 references
minimal polynomial
0 references
0.9495223760604858
0 references
0.9237719178199768
0 references
0.8850647807121277
0 references
0.8833778500556946
0 references
