On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory (Q2668568)
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 7485147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory |
scientific article; zbMATH DE number 7485147 |
Statements
On the \(k\)-error linear complexity for \(p^n\)-periodic binary sequences via hypercube theory (English)
0 references
7 March 2022
0 references
periodic binary sequence
0 references
linear complexity
0 references
\(k\)-error linear complexity
0 references
hypercube theory
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8844815492630005
0 references
0.8495949506759644
0 references
0.8211132884025574
0 references
0.8145985007286072
0 references
