Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.16313 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929327176679424 |
|---|---|
| author | Yuan, Qin Li, Chunlei Zeng, Xiangyong Helleseth, Tor He, Debiao |
| author_facet | Yuan, Qin Li, Chunlei Zeng, Xiangyong Helleseth, Tor He, Debiao |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_16313 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Further Investigations on Nonlinear Complexity of Periodic Binary Sequences Yuan, Qin Li, Chunlei Zeng, Xiangyong Helleseth, Tor He, Debiao Information Theory 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. |
| title | Further Investigations on Nonlinear Complexity of Periodic Binary Sequences |
| topic | Information Theory |
| url | https://arxiv.org/abs/2404.16313 |