Finding automatic sequences with few correlations

Vincent Juge,Irene Marcovici

RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS(2024)

引用 0|浏览0
暂无评分
摘要
Although automatic sequences are algorithmically very simple, some of them have pseudorandom properties. In particular, some automatic sequences such as the Golay-Shapiro sequence are known to be 2-uncorrelated, meaning that they have the same correlations of order 2 as a uniform random sequence. However, the existence of l-uncorrelated automatic sequences (for l >= 3) was left as an open question in a recent paper of Marcovici, Stoll and Tahay. We exhibit binary block-additive sequences that are 3-uncorrelated and, with the help of analytical results supplemented by an exhaustive search, we present a complete picture of the correlation properties of binary block-additive sequences of rank r <= 5, and ternary sequences of rank r <= 3.
更多
查看译文
关键词
Combinatorics on words,automata sequence,well-distributed sequence
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要