On the classification of periodic binary sequences into nonlinear complexity classes

Authors:
George Petrides;Johannes Mykkeltveit
Affiliations:
School of Mathematics, University of Manchester, Manchester, UK;IRIS, International Research Institute of Stavanger, Bergen, Norway
Venue:
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Year:
2006

Citing 3
Cited 1

An Approximate Distribution for the Maximum Order Complexity

Designs, Codes and Cryptography
Shift Register Sequences

Shift Register Sequences
How to embed short cycles into large nonlinear feedback-shift registers

SCN'04 Proceedings of the 4th international conference on Security in Communication Networks

Composition of recursions and nonlinear complexity of periodic binary sequences

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate the notion of nonlinear complexity, or maximal order complexity as it was first defined in 1989 [4]. Our main purpose is to begin classification of periodic binary sequences into nonlinear complexity classes. Previous work on the subject also includes approximation of the size of each class, found in [2]. Once the classification is completed, we can use it to show how to perform checks for short cycles in large nonlinear feedback shift registers using our proposed algorithm.