Further Investigations on Nonlinear Complexity of Periodic Binary Sequences
Information Theory
2024-04-26 v1 math.IT
Abstract
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.
Cite
@article{arxiv.2404.16313,
title = {Further Investigations on Nonlinear Complexity of Periodic Binary Sequences},
author = {Qin Yuan and Chunlei Li and Xiangyong Zeng and Tor Helleseth and Debiao He},
journal= {arXiv preprint arXiv:2404.16313},
year = {2024}
}