Further Investigations on Nonlinear Complexity of Periodic Binary Sequences
IEEE Transactions on Information Theory(2024)
摘要
Nonlinear complexity is an important measure for assessing the randomness of
sequences. In this paper we investigate how circular shifts affect the
nonlinear complexities of finite-length binary sequences and then reveal a more
explicit relation between nonlinear complexities of finite-length binary
sequences and their corresponding periodic sequences. Based on the relation, we
propose two algorithms that can generate all periodic binary sequences with any
prescribed nonlinear complexity.
更多查看译文
关键词
Periodic sequence,nonlinear complexity,randomness
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要