Show simple item record

dc.contributor.authorZhou, J.
dc.contributor.authorLiu, Wan-Quan
dc.contributor.authorWang, X.
dc.identifier.citationZhou, J. and Liu, W. and Wang, X. 2017. Structure analysis on the k-error linear complexity for 2n-periodic binary sequences. Journal of Industrial and management optimization. 13 (4): pp. 1743-1757.

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.

dc.publisherAmerican Institute of Mathematical Sciences
dc.titleStructure analysis on the k-error linear complexity for 2n-periodic binary sequences
dc.typeJournal Article
dcterms.source.titleJournal of Industrial and management optimization
curtin.departmentDepartment of Computing
curtin.accessStatusFulltext not available

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record