A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences (Q438884)
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 6062564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences |
scientific article; zbMATH DE number 6062564 |
Statements
A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences (English)
0 references
31 July 2012
0 references
periodic sequence
0 references
linear complexity
0 references
\(k\)-error linear complexity
0 references
0.8031841516494751
0 references
0.8025364875793457
0 references
0.7928657531738281
0 references
0.7879968881607056
0 references
