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

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.