A fast algorithm for determining the linear complexity of a binary sequence with period \(2^np^m\) (Q865964)
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 5128521
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for determining the linear complexity of a binary sequence with period \(2^np^m\) |
scientific article; zbMATH DE number 5128521 |
Statements
A fast algorithm for determining the linear complexity of a binary sequence with period \(2^np^m\) (English)
0 references
20 February 2007
0 references
cryptography
0 references
periodic sequence
0 references
linear complexity
0 references
minimal polynomial
0 references
fast algorithm
0 references
0.92045396566391
0 references
0.9002066254615784
0 references
0.8992727994918823
0 references
0.8988076448440552
0 references
