Characterization of the third descent points for the kerror linear complexity of 2nperiodic binary sequences
Access Status
Authors
Date
2016Collection
Type
Metadata
Show full item recordAbstract
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 GamesChan algorithm. Accordingly, the third descent point (critical point) distribution of the kerror linear complexity for 2n periodic binary sequences is characterized. As a consequence, we derive the complete counting functions on the 5error 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 kerror linear complexity for 2n periodic binary sequences.
Citation
Source Title
Department
Related items
Showing items related by title, author, creator and subject.

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

Zhou, J.; Liu, WanQuan; Wang, X. (2016)© 2016 SERSC. The linear complexity and kerror linear complexity of a sequence have been used as important measures for keystream strength. In order to study kerror linear complexity of binary sequences with period 2n, ...

Zhou, J.; Liu, WanQuan; Wang, X. (2017)In this paper, in order to characterize the critical error linear complexity spectrum (CELCS) for 2 n periodic binary sequences, we first propose a decomposition based on the cube theory. Based on the proposed kerror ...