On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences
In this paper, a constructive approach for determining CELCS (critical error linear complexity spectrum) for the kerror linear complexity distribution of 2n -periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the second descent point (critical point) d...
| Main Authors: | , , |
|---|---|
| Format: | Conference Paper |
| Published: |
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/63463 |
| _version_ | 1848761094434193408 |
|---|---|
| author | Zhou, J. Wang, X. Liu, Wan-Quan |
| author_facet | Zhou, J. Wang, X. Liu, Wan-Quan |
| author_sort | Zhou, J. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | In this paper, a constructive approach for determining CELCS (critical error linear complexity spectrum) for the kerror linear complexity distribution of 2n -periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the second descent point (critical point) distribution of the k-error linear complexity for 2n -periodic binary sequences is characterized. As a by product, it is proved that the maximum k-error linear complexity is 2n -(2l -1) over all 2n -periodic binary sequences, where 2l-1<=k < 2l and l < n. With these results, some work by Niu et al. are proved to be incorrect. |
| first_indexed | 2025-11-14T10:26:12Z |
| format | Conference Paper |
| id | curtin-20.500.11937-63463 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T10:26:12Z |
| publishDate | 2016 |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-634632018-02-06T06:17:34Z On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences Zhou, J. Wang, X. Liu, Wan-Quan In this paper, a constructive approach for determining CELCS (critical error linear complexity spectrum) for the kerror linear complexity distribution of 2n -periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the second descent point (critical point) distribution of the k-error linear complexity for 2n -periodic binary sequences is characterized. As a by product, it is proved that the maximum k-error linear complexity is 2n -(2l -1) over all 2n -periodic binary sequences, where 2l-1<=k < 2l and l < n. With these results, some work by Niu et al. are proved to be incorrect. 2016 Conference Paper http://hdl.handle.net/20.500.11937/63463 restricted |
| spellingShingle | Zhou, J. Wang, X. Liu, Wan-Quan On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences |
| title | On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences |
| title_full | On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences |
| title_fullStr | On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences |
| title_full_unstemmed | On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences |
| title_short | On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences |
| title_sort | on the second descent points for the k-error linear complexity of 2(n)-periodic binary sequences |
| url | http://hdl.handle.net/20.500.11937/63463 |