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 this page instead for the normal view: A counterexample concerning the 3-error linear complexity of \(2^{n }\)-periodic binary sequences |
scientific article; zbMATH DE number 6062564
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
