Please use this identifier to cite or link to this item:
|Title:||How many bits have to be changed to decrease the linear complexity?|
k-error linear complexity
|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|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 19, 2018
WEB OF SCIENCETM
checked on Sep 5, 2018
checked on May 10, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.