Structure analysis on the kerror linear complexity for 2<sup>n</sup>periodic binary sequences
Access Status
Authors
Date
2017Collection
Type
Metadata
Show full item recordAbstract
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 cube decomposition, and the famous inclusionexclusion principle, we obtain the complete characterization of the ith descent point (critical point) of the kerror linear complexity for i = 2; 3. In fact, the proposed constructive approach has the potential to be used for constructing 2 n periodic binary sequences with the given linear complexity and kerror linear complexity (or CELCS), which is a challenging problem to be deserved for further investigation in future.
Citation
Source Title
Department
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, Jianqin; Liu, Wanquan (2013)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 ...

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, ...