Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/103925
Title: Periodic sequences with maximal linear complexity and almost maximal k-rrror linear complexity
Authors: Niederreiter, H. 
Shparlinski, I.E.
Issue Date: 2003
Citation: Niederreiter, H.,Shparlinski, I.E. (2003). Periodic sequences with maximal linear complexity and almost maximal k-rrror linear complexity. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2898 : 183-189. ScholarBank@NUS Repository.
Abstract: C. Ding, W. Shan and G. Xiao conjectured a certain kind of trade-off between the linear complexity and the k-error linear complexity of periodic sequences over a finite field. This conjecture has recently been disproved by the first author, by showing that for infinitely many period lengths N and some values of k both complexities may take very large values (contradicting the above conjecture). Here we use some recent achievements of analytic number theory to extend the class of period lengths N and the number of admissible errors k for which this conjecture fails for rather large values of k. We also discuss the relevance of this result for stream ciphers. © Springer-Verlag Berlin Heidelberg 2003.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/103925
ISSN: 03029743
Appears in Collections:Staff Publications

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

Page view(s)

26
checked on Nov 16, 2018

Google ScholarTM

Check


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