Further Investigations on Nonlinear Complexity of Periodic Binary Sequences
<|reference_start|>Further Investigations on Nonlinear Complexity of Periodic Binary Sequences: 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.<|reference_end|>
@article{yuan2024further,
    title={Further Investigations on Nonlinear Complexity of Periodic Binary
  Sequences},
    author={Qin Yuan, Chunlei Li, Xiangyong Zeng, Tor Helleseth, and Debiao He},
    journal={arXiv preprint arXiv:2404.16313},
    year={2024},
    archivePrefix={arXiv},
    eprint={2404.16313},
    primaryClass={cs.IT math.IT}
}