The k-error linear complexity distribution for 2n-periodic binary sequences
The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, we investigate the k-error linear complexity distribution of 2 n-...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Springer
2013
|
| Online Access: | http://hdl.handle.net/20.500.11937/43040 |
| _version_ | 1848756581035933696 |
|---|---|
| author | Zhou, Jianqin Liu, Wan-quan |
| author_facet | Zhou, Jianqin Liu, Wan-quan |
| author_sort | Zhou, Jianqin |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, we investigate the k-error linear complexity distribution of 2 n-periodic binary sequences in this paper based on Games–Chan algorithm. First, for k=2,3, the complete counting functions for the k-error linear complexity of 2 n-periodic binary sequences (with linear complexity less than 2n) are characterized. Second, for k=3,4, the complete counting functions for the k-error linear complexity of 2 n-periodic binary sequences with linear complexity 2n are presented. Third, as a consequence of these results, the counting functions for the number of 2 n-periodic binary sequences with the k-error linear complexity for k=2 and 3 are obtained. |
| first_indexed | 2025-11-14T09:14:28Z |
| format | Journal Article |
| id | curtin-20.500.11937-43040 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:14:28Z |
| publishDate | 2013 |
| publisher | Springer |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-430402017-09-13T15:06:00Z The k-error linear complexity distribution for 2n-periodic binary sequences Zhou, Jianqin Liu, Wan-quan The linear complexity and the k-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, we investigate the k-error linear complexity distribution of 2 n-periodic binary sequences in this paper based on Games–Chan algorithm. First, for k=2,3, the complete counting functions for the k-error linear complexity of 2 n-periodic binary sequences (with linear complexity less than 2n) are characterized. Second, for k=3,4, the complete counting functions for the k-error linear complexity of 2 n-periodic binary sequences with linear complexity 2n are presented. Third, as a consequence of these results, the counting functions for the number of 2 n-periodic binary sequences with the k-error linear complexity for k=2 and 3 are obtained. 2013 Journal Article http://hdl.handle.net/20.500.11937/43040 10.1007/s10623-013-9805-8 Springer restricted |
| spellingShingle | Zhou, Jianqin Liu, Wan-quan The k-error linear complexity distribution for 2n-periodic binary sequences |
| title | The k-error linear complexity distribution for 2n-periodic binary sequences |
| title_full | The k-error linear complexity distribution for 2n-periodic binary sequences |
| title_fullStr | The k-error linear complexity distribution for 2n-periodic binary sequences |
| title_full_unstemmed | The k-error linear complexity distribution for 2n-periodic binary sequences |
| title_short | The k-error linear complexity distribution for 2n-periodic binary sequences |
| title_sort | k-error linear complexity distribution for 2n-periodic binary sequences |
| url | http://hdl.handle.net/20.500.11937/43040 |