Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2002.807308
Title: Periodic sequences with large k-error linear complexity
Authors: Niederreiter, H. 
Keywords: Cyclotomy
k-error linear complexity
Linear complexity
Periodic sequences
Sphere complexity
Stream ciphers
Issue Date: Feb-2003
Citation: Niederreiter, H. (2003-02). Periodic sequences with large k-error linear complexity. IEEE Transactions on Information Theory 49 (2) : 501-505. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2002.807308
Abstract: We establish the existence of periodic sequences over a finite field which simultaneously achieve the maximum value (for the given period length) of the linear complexity and of the k-error linear complexity for small values of k. This disproves a conjecture of Ding, Xiao, and Shan. The result is of relevance for the theory of stream ciphers.
Source Title: IEEE Transactions on Information Theory
URI: http://scholarbank.nus.edu.sg/handle/10635/103924
ISSN: 00189448
DOI: 10.1109/TIT.2002.807308
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

27
checked on Jun 20, 2018

WEB OF SCIENCETM
Citations

20
checked on Jun 20, 2018

Page view(s)

24
checked on Feb 25, 2018

Google ScholarTM

Check

Altmetric


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