On evaluating the linear complexity of a sequence of least period \(2^ n\) (Q1329115)
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 597834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On evaluating the linear complexity of a sequence of least period \(2^ n\) |
scientific article; zbMATH DE number 597834 |
Statements
On evaluating the linear complexity of a sequence of least period \(2^ n\) (English)
0 references
4 September 1994
0 references
feedback shift register
0 references
algorithm
0 references
linear complexity
0 references
0.8805688619613647
0 references
0.8671121597290039
0 references
0.859036922454834
0 references
