[Resource Topic] 2024/632: Further Investigations on Nonlinear Complexity of Periodic Binary Sequences

Welcome to the resource topic for 2024/632

Title:
Further Investigations on Nonlinear Complexity of Periodic Binary Sequences

Authors: Qin Yuan, Chunlei Li, Xiangyong Zeng, Tor Helleseth, Debiao He

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.

ePrint: https://eprint.iacr.org/2024/632

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .