Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences

DOI10.1007/s12095-021-00507-wzbMath1486.11010arXiv2106.09959OpenAlexW3182950696MaRDI QIDQ2121010

Pierre Popoli, Thomas Stoll, Damien Jamet

Publication date: 1 April 2022

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

Full work available at URL: https://arxiv.org/abs/2106.09959

zbMATH Keywords

pseudorandomnessZeckendorf expansionmaximum order complexitymorphic sequences

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Automata sequences (11B85) Sequences (mod (m)) (11B50) Pseudo-random numbers; Monte Carlo methods (11K45)

Related Items (2)

Pseudorandom sequences derived from automatic sequences ⋮ Note on a Fibonacci parity sequence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the linear complexity profile of some sequences derived from elliptic curves
• Combinatorial constructions for the Zeckendorf sum of digits of polynomial values
• Expansion complexity and linear complexity of sequences over finite fields
• The smallest automaton recognizing the subwords of a text
• Substitution dynamical systems - spectral analysis
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction
• Normality along squares
• Automata and numeration systems
• Perfect linear complexity profile and apwenian sequences
• Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
• On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values
• On the \(N\)th maximum order complexity and the expansion complexity of a Rudin-Shapiro-like sequence
• On the subword complexity of Thue-Morse polynomial extractions
• Classical and modular approaches to exponential Diophantine equations. I: Fibonacci and Lucas perfect powers
• Sequences With High Nonlinear Complexity
• The Maximum Order Complexity of Sequence Ensembles
• Automatic Sequences
• Möbius orthogonality for the Zeckendorf sum-of-digits function
• On the Maximum Order Complexity of the Thue-Morse and Rudin-Shapiro Sequence
• On the use of expansion series for stream ciphers
• Multiplicative properties of the Thue-Morse sequence

This page was built for publication: Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences