Sequences with high nonlinear complexity
classification
💻 cs.IT
math.ITmath.NT
keywords
complexitynonlinearsequencesfieldsfiniteth-orderbehaviorbounds
read the original abstract
We improve lower bounds on the $k$th-order nonlinear complexity of pseudorandom sequences over finite fields and we establish a probabilistic result on the behavior of the $k$th-order nonlinear complexity of random sequences over finite fields.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.