The nonlinear complexity of level sequences over \(\mathbb Z/(4)\) (Q814766)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The nonlinear complexity of level sequences over \(\mathbb Z/(4)\)
scientific article

    Statements

    The nonlinear complexity of level sequences over \(\mathbb Z/(4)\) (English)
    0 references
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references