Please use this identifier to cite or link to this item: https://doi.org/10.1023/B:DESI.0000035466.28660.e9
Title: How many bits have to be changed to decrease the linear complexity?
Authors: Meidl, W. 
Keywords: Algorithm
k-error linear complexity
Linear complexity
Periodic sequences
Stream ciphers
Issue Date: Sep-2004
Citation: Meidl, W. (2004-09). How many bits have to be changed to decrease the linear complexity?. Designs, Codes, and Cryptography 33 (2) : 109-122. ScholarBank@NUS Repository. https://doi.org/10.1023/B:DESI.0000035466.28660.e9
Abstract: The k-error linear complexity of periodic binary sequences is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits of the sequence per period. For the period length p n, where p is an odd prime and 2 is a primitive root modulo p 2, we show a relationship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity. Moreover, we describe an algorithm to determine the k-error linear complexity of a given p n-periodic binary sequence.
Source Title: Designs, Codes, and Cryptography
URI: http://scholarbank.nus.edu.sg/handle/10635/132767
ISSN: 09251022
DOI: 10.1023/B:DESI.0000035466.28660.e9
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

25
checked on Jul 17, 2018

WEB OF SCIENCETM
Citations

22
checked on Jul 17, 2018

Page view(s)

7
checked on May 10, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.