On the Nth maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence
- 19 Downloads
Based on the parity of the number of occurrences of a pattern 10 as a scattered subsequence in the binary representation of integers, a Rudin-Shapiro-like sequence is defined by Lafrance, Rampersad and Yee. The Nth maximum order complexity and the expansion complexity of this Rudin-Shapiro-like sequence are calculated in this paper.
KeywordsRudin-Shapiro-like sequence Maximum order complexity Expansion complexity
Mathematics Subject Classification (2010)11B50 11B85 11K45
- 7.Jansen, C.J.A.: Investigations on Nonlinear Streamcipher Systems: Construction and Evaluation Methods. Ph.D.dissertation, Technical University of Delft, Delft (1989)Google Scholar
- 8.Jansen, C.J.A.: The Maximum Order Complexity of Sequence Ensembles. In: Davies, D.W. (ed.) Advances in Cryptology - EUROCRYPT ’91, Lect. Notes Comput. Sci., vol. 547, pp 153–159. Springer, Berlin (1991)Google Scholar
- 14.Sun, Z., Winterhof, A.: On the maximum order complexity of the Thue-Morse sequence and the Rudin-Shapiro sequence. Preprint (2017)Google Scholar