The kerror linear complexity distribution for 2nperiodic binary sequences
Access Status
Authors
Date
2013Collection
Type
Metadata
Show full item recordAbstract
The linear complexity and the kerror 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 kerror linear complexity distribution of 2 nperiodic binary sequences in this paper based on Games–Chan algorithm. First, for k=2,3, the complete counting functions for the kerror linear complexity of 2 nperiodic binary sequences (with linear complexity less than 2n) are characterized. Second, for k=3,4, the complete counting functions for the kerror linear complexity of 2 nperiodic binary sequences with linear complexity 2n are presented. Third, as a consequence of these results, the counting functions for the number of 2 nperiodic binary sequences with the kerror linear complexity for k=2 and 3 are obtained.
Citation
Source Title
Related items
Showing items related by title, author, creator and subject.

Zhou, J.; Liu, WanQuan; Wang, X. (2017)In this paper, a new constructive approach of determining the first descent point distribution for the kerror linear complexity of 2 n periodic binary sequences is developed using the sieve method and GamesChan ...

Zhou, J.; Liu, WanQuan; Wang, X. (2016)In this paper, a structural approach for determining CELCS (critical error linear complexity spectrum) for the kerror linear complexity distribution of 2nperiodic binary sequences is developed via the sieve method and ...

Zhou, J.; Wang, X.; Liu, WanQuan (2016)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 ...