Characterization of the third descent points for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences (Q2801767)
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: Characterization of the third descent points for the k-error linear complexity of 2ⁿ-periodic binary sequences |
scientific article; zbMATH DE number 6572048
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of the third descent points for the \(k\)-error linear complexity of \(2^n\)-periodic binary sequences |
scientific article; zbMATH DE number 6572048 |
Statements
Characterization of the Third Descent Points for the k-error Linear Complexity of $$2^n$$-periodic Binary Sequences (English)
0 references
21 April 2016
0 references
periodic sequence
0 references
linear complexity
0 references
\(k\)-error linear complexity
0 references
\(k\)-error linear complexity distribution
0 references
0 references
0 references
0 references
0 references
0.9038071632385254
0 references
0.8876311779022217
0 references
0.8721410632133484
0 references
