Sequences With High Nonlinear Complexity
Harald Niederreiter, Chaoping Xing · IEEE Transactions on Information Theory · 2014
We improve lower bounds on the k th-order nonlinear complexity of pseudorandom sequences over finite fields, including explicit inversive sequences and sequences obtained from Hermitian function fields, and we establish a probabilistic result on the behavior of the k th-order nonlinear complexity of random sequences over finite fields.