Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2004.842709
Title: On the stability of 2n-periodic binary sequences
Authors: Meidl, W. 
Keywords: (k-error) linear complexity
Chan-Games algorithm
Cryptography
Periodic sequences
Stability of stream ciphers
Issue Date: Mar-2005
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
URI: http://scholarbank.nus.edu.sg/handle/10635/132765
ISSN: 00189448
DOI: 10.1109/TIT.2004.842709
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

35
checked on Feb 12, 2019

WEB OF SCIENCETM
Citations

27
checked on Feb 12, 2019

Page view(s)

11
checked on Jan 18, 2019

Google ScholarTM

Check

Altmetric


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