Please use this identifier to cite or link to this item:
|Title:||On the stability of 2n-periodic binary sequences|
|Keywords:||(k-error) linear complexity|
Stability of stream ciphers
|Citation:||Meidl, W. (2005-03). On the stability of 2n-periodic binary sequences. IEEE Transactions on Information Theory 51 (3) : 1151-1155. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2004.842709|
|Abstract:||The k-error linear complexity of a periodic binary sequence is defined to be the smallest linear complexity that can be obtained by changing κ or fewer bits per period. This contribution focuses on the case of 2n-periodic binary sequences. For κ = 1, 2, the exact formula for the expected κ-error linear complexity of a sequence having maximal possible linear complexity 2n, and the exact formula of the expected 1-error linear complexity of a random 2n-periodic binary sequence are provided. For κ ≥ 2, lower and upper bounds on the expected value of the κ-error linear complexity of a random 2n-periodic binary sequence are established. © 2005 IEEE.|
|Source Title:||IEEE Transactions on Information Theory|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jun 16, 2018
WEB OF SCIENCETM
checked on May 30, 2018
checked on Apr 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.