On the Second Descent Points for the K-Error Linear Complexity of 2(n)-Periodic Binary Sequences
MetadataShow full item record
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 Games-Chan algorithm. Accordingly, the second descent point (critical point) distribution of the k-error linear complexity for 2n -periodic binary sequences is characterized. As a by product, it is proved that the maximum k-error linear complexity is 2n -(2l -1) over all 2n -periodic binary sequences, where 2l-1<=k < 2l and l < n. With these results, some work by Niu et al. are proved to be incorrect.
Showing items related by title, author, creator and subject.
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, ...
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 ...
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 ...