Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.01134 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915767270768640 |
|---|---|
| author | Yuan, Qin Li, Chunlei Zeng, Xiangyong |
| author_facet | Yuan, Qin Li, Chunlei Zeng, Xiangyong |
| contents | Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary sequences with nonlinear complexity larger than or equal to 3n/4 is characterized. Based on their structure, an exact enumeration formula for the number of such periodic sequences is determined. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_01134 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | The structure and enumeration of periodic binary sequences with high nonlinear complexity Yuan, Qin Li, Chunlei Zeng, Xiangyong Information Theory Nonlinear complexity, as an important measure for assessing the randomness of sequences, is defined as the length of the shortest feedback shift registers that can generate a given sequence. In this paper, the structure of n-periodic binary sequences with nonlinear complexity larger than or equal to 3n/4 is characterized. Based on their structure, an exact enumeration formula for the number of such periodic sequences is determined. |
| title | The structure and enumeration of periodic binary sequences with high nonlinear complexity |
| topic | Information Theory |
| url | https://arxiv.org/abs/2602.01134 |