The nonlinear complexity of level sequences over \(\mathbb Z/(4)\) (Q814766)
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: The nonlinear complexity of level sequences over Z/(4) |
scientific article; zbMATH DE number 5004388
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The nonlinear complexity of level sequences over \(\mathbb Z/(4)\) |
scientific article; zbMATH DE number 5004388 |
Statements
The nonlinear complexity of level sequences over \(\mathbb Z/(4)\) (English)
0 references
7 February 2006
0 references
The authors investigate the issue of determining the number of bits required to uniquely determine a primitive sequence which is related to primitive polynomials over \(\text{GF}(2^2)\). They provide precise upper bounds on the nonlinear complexity of primitive polynomials which are trinomials over the Galois field of two elements. A corollary of these results is that the nonlinear complexity is much smaller than the linear complexity.
0 references
integer residue ring
0 references
primitive polynomial
0 references
linear recurring sequence
0 references
linear complexity
0 references
nonlinear complexity
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.798321545124054
0 references
0.7933904528617859
0 references
0.7927444577217102
0 references
0.7606781721115112
0 references
0.760115385055542
0 references
