Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences
In this paper, a structural approach for determining CELCS (critical error linear complexity spectrum) for the k-error linear complexity distribution of 2n-periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the third descent point (critical point) dist...
| Main Authors: | , , |
|---|---|
| Format: | Book Chapter |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/45017 |
| _version_ | 1848757165211254784 |
|---|---|
| author | Zhou, J. Liu, Wan-Quan Wang, X. |
| author_facet | Zhou, J. Liu, Wan-Quan Wang, X. |
| author_sort | Zhou, J. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | In this paper, a structural approach for determining CELCS (critical error linear complexity spectrum) for the k-error linear complexity distribution of 2n-periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the third descent point (critical point) distribution of the k-error linear complexity for 2n- periodic binary sequences is characterized. As a consequence, we derive the complete counting functions on the 5-error linear complexity of 2n- periodic binary sequences when it is the third descent point. With the structural approach proposed here, one can further characterize other third and fourth descent points of the k-error linear complexity for 2n- periodic binary sequences. |
| first_indexed | 2025-11-14T09:23:45Z |
| format | Book Chapter |
| id | curtin-20.500.11937-45017 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:23:45Z |
| publishDate | 2016 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-450172017-09-13T15:34:03Z Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences Zhou, J. Liu, Wan-Quan Wang, X. In this paper, a structural approach for determining CELCS (critical error linear complexity spectrum) for the k-error linear complexity distribution of 2n-periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the third descent point (critical point) distribution of the k-error linear complexity for 2n- periodic binary sequences is characterized. As a consequence, we derive the complete counting functions on the 5-error linear complexity of 2n- periodic binary sequences when it is the third descent point. With the structural approach proposed here, one can further characterize other third and fourth descent points of the k-error linear complexity for 2n- periodic binary sequences. 2016 Book Chapter http://hdl.handle.net/20.500.11937/45017 10.1007/978-3-319-29814-6_14 restricted |
| spellingShingle | Zhou, J. Liu, Wan-Quan Wang, X. Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences |
| title | Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences |
| title_full | Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences |
| title_fullStr | Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences |
| title_full_unstemmed | Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences |
| title_short | Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences |
| title_sort | characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences |
| url | http://hdl.handle.net/20.500.11937/45017 |