On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence
From MaRDI portal
Publication:2202887
DOI10.1007/s12095-019-00396-0zbMath1478.11023OpenAlexW2972635911MaRDI QIDQ2202887
Da Lin, Zhimin Sun, Xiangyong Zeng
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
Automata sequences (11B85) Sequences (mod (m)) (11B50) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (2)
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences ⋮ Pseudorandom sequences derived from automatic sequences
Cites Work
- Some properties of a Rudin-Shapiro-like sequence
- Expansion complexity and linear complexity of sequences over finite fields
- 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
- Spectrum of a Rudin-Shapiro-like sequence
- Generalized Rudin-Shapiro sequences
- The Maximum Order Complexity of Sequence Ensembles
- A Case Study in Mathematical Research: The Golay-Rudin-Shapiro Sequence
- Automatic Sequences
- The Rudin–Shapiro Sequence and Similar Sequences Are Normal Along Squares
- On a Golay-Shapiro-Like Sequence
- Sequences with almost perfect linear complexity profiles and curves over finite fields
- On the use of expansion series for stream ciphers
This page was built for publication: On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence
