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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill Book Company, New York (1968)
Erdmann, D., Murphy, S.: An Approximate Distribution for the Maximum Order Complexity, Designs, Codes and Cryptography, vol. 10, pp. 325–339. Springer, Heidelberg (1997)
Golomb, S.W.: Shift Register Sequences, Revised edition. Aegean Park Press, Laguna Hills (1982)
Jansen, C.J.A.: Investigations on Nonlinear Streamcipher Systems: Construction and Evaluation Methods, PhD Thesis, Technical University of Delft (1989)
Van Ly, L., Schindler, W.: How to Embed Short Cycles into Large Nonlinear Feedback-Shift Registers. In: Blundo, C., Cimato, S. (eds.) SCN 2004. LNCS, vol. 3352, pp. 367–379. Springer, Heidelberg (2005)
Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Transactions on Information Theory IT-15, 81–92 (1969)
The On-Line Encyclopedia of Integer Sequences, http://www.research.att.com/~njas/sequences/?Anum=A001037
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Petrides, G., Mykkeltveit, J. (2006). On the Classification of Periodic Binary Sequences into Nonlinear Complexity Classes. In: Gong, G., Helleseth, T., Song, HY., Yang, K. (eds) Sequences and Their Applications – SETA 2006. SETA 2006. Lecture Notes in Computer Science, vol 4086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863854_18
Download citation
DOI: https://doi.org/10.1007/11863854_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44523-4
Online ISBN: 978-3-540-44524-1
eBook Packages: Computer ScienceComputer Science (R0)