Structure analysis on the k-error linear complexity for 2<sup>n</sup>-periodic binary sequences
MetadataShow full item record
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 k-error cube decomposition, and the famous inclusion-exclusion principle, we obtain the complete characterization of the ith descent point (critical point) of the k-error 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 k-error linear complexity (or CELCS), which is a challenging problem to be deserved for further investigation in future.
Showing items related by title, author, creator and subject.
Complete characterization of the first descent point distribution for the k-error linear complexity of 2n-periodic binary sequencesZhou, J.; Liu, Wan-Quan; Wang, X. (2017)In this paper, a new constructive approach of determining the first descent point distribution for the k-error linear complexity of 2 n -periodic binary sequences is developed using the sieve method and Games-Chan ...
Zhou, Jianqin; Liu, Wan-quan (2013)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 ...
Zhou, J.; Liu, Wan-Quan; Wang, X. (2016)© 2016 SERSC. The linear complexity and k-error linear complexity of a sequence have been used as important measures for keystream strength. In order to study k-error linear complexity of binary sequences with period 2n, ...