论文标题
完美的线性复杂度曲线和Apwenian序列
Perfect linear complexity profile and Apwenian sequences
论文作者
论文摘要
三十多年前，定义了具有{\ em完美线性复杂度}的序列在研究二进制序列随机度的研究中。最近，在自动序列的Hankel决定因素的研究中引入了{\ em apwenian序列}，首先是$ \ pm 1 $，然后以$ \ {0，1 \} $中的值。我们解释说，这两个序列家庭与索引相同，并给出了这意味着的后果和问题。我们希望这将有助于聚集两个不同的研究人员社区。
Sequences with {\em perfect linear complexity profile} were defined more than thirty years ago in the study of measures of randomness for binary sequences. More recently {\em apwenian sequences}, first with values $\pm 1$, then with values in $\{0, 1\}$, were introduced in the study of Hankel determinants of automatic sequences. We explain that these two families of sequences are the same up to indexing, and give consequences and questions that this implies. We hope that this will help gathering two distinct communities of researchers.
