Analysis of the k-Error Linear Complexity and Error Sequence for 2pn-Periodic Binary Sequence

Zhihua NIU  Deyu KONG  Yanli REN  Xiaoni DU  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E101-A   No.8   pp.1197-1203
Publication Date: 2018/08/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E101.A.1197
Type of Manuscript: PAPER
Category: Cryptography and Information Security
periodic sequence,  linear complexity,  k-error linear complexity,  error sequence,  

Full Text: PDF(1.2MB)>>
Buy this Article

The k-error linear complexity of a sequence is a fundamental concept for assessing the stability of the linear complexity. After computing the k-error linear complexity of a sequence, those bits that cause the linear complexity reduced also need to be determined. For binary sequences with period 2pn, where p is an odd prime and 2 is a primitive root modulo p2, we present an algorithm which computes the minimum number k such that the k-error linear complexity is not greater than a given constant c. The corresponding error sequence is also obtained.