Sequences with high nonlinear complexity
Abstract
We improve lower bounds on the kth-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the kth-order nonlinear complexity of random sequences over finite fields.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.