On the Nth maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence

DOI10.1007/S12095-019-00396-0MaRDI QIDQ2202887zbMATH OpenOpenAlexFDO

Authors Zhimin Sun, Xiangyong Zeng, Da Lin

Publication date 30 September 2020

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-019-00396-0

zbMATH Keywords

expansion complexitymaximum order complexityRudin-Shapiro-like sequence

Mathematics Subject Classification ID

Sequences (mod (m)) (11B50) Automata sequences (11B85) Pseudo-random numbers; Monte Carlo methods (11K45)

Recommendations

• On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence
• On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values
• Some properties of a Rudin-Shapiro-like sequence
• Complexity of generalized Rudin-Shapiro sequences
• Generalized Rudin-Shapiro sequences

Cites work

• A Case Study in Mathematical Research: The Golay-Rudin-Shapiro Sequence
• Automatic Sequences
• Expansion complexity and linear complexity of sequences over finite fields
• Generalized Rudin-Shapiro sequences
• On a Golay-Shapiro-like sequence
• On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction
• On the \(N\)th linear complexity of automatic sequences
• On the use of expansion series for stream ciphers
• Sequences with almost perfect linear complexity profiles and curves over finite fields
• Some properties of a Rudin-Shapiro-like sequence
• Spectrum of a Rudin-Shapiro-like sequence
• The Maximum Order Complexity of Sequence Ensembles
• The Rudin-Shapiro sequence and similar sequences are normal along squares

Cited in

(4)

• Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
• On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values
• Pseudorandom sequences derived from automatic sequences
• On the maximum order complexity of the Thue-Morse and Rudin-Shapiro sequence

This page was built for publication: On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2202887)