On the k-error linear complexity of generalised cyclotomic sequences. (2016)

• Record Type: Journal Article
• Authors: Liu, Longfei; Yang, Xiaoyuan; Du, Xiaoni; Wei, Bin
• Is Part Of: International journal of high performance computing and networking. Volume 9:Number 5/6(2016)
• Page Start: 394
• Page End: 400
• Publication Date: 2016
• Subjects: stream cipher -- pseudo-random sequences -- generalised cyclotomy -- k-error linear complexity -- trace representation -- cyclotomic theory; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

Abstract

Generalised cyclotomic binary sequences are divided into Whiteman-generalised cyclotomic and Ding-generalised cyclotomic. Firstly, two classes of error generalised cyclotomic sequences with length pq over Zpq are constructed; secondly, k-error linear complexity of generalised cyclotomic sequences are considered, using the trace representation and cyclotomic theory, respectively. It is shown that k-error linear complexity of generalised cyclotomic sequences do not exceed p + q-1 which is much less than the (zero-error) linear complexity.