Characterization of the third descent points for the k-error linear complexity of 2n-periodic binary sequences
MetadataShow full item record
In this paper, a structural approach for determining CELCS (critical error linear complexity spectrum) for the k-error linear complexity distribution of 2n-periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the third descent point (critical point) distribution of the k-error linear complexity for 2n- periodic binary sequences is characterized. As a consequence, we derive the complete counting functions on the 5-error 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 k-error linear complexity for 2n- periodic binary sequences.
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 ...
Zhou, Jianqin (2017)This thesis proposes various novel approaches for studying the k-error linear complexity distribution of periodic binary sequences for k > 2, and the second descent point and beyond of k-error linear complexity critical ...