Please use this identifier to cite or link to this item:
https://scholarbank.nus.edu.sg/handle/10635/103925
DC Field | Value | |
---|---|---|
dc.title | Periodic sequences with maximal linear complexity and almost maximal k-rrror linear complexity | |
dc.contributor.author | Niederreiter, H. | |
dc.contributor.author | Shparlinski, I.E. | |
dc.date.accessioned | 2014-10-28T02:43:08Z | |
dc.date.available | 2014-10-28T02:43:08Z | |
dc.date.issued | 2003 | |
dc.identifier.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. | |
dc.identifier.issn | 03029743 | |
dc.identifier.uri | http://scholarbank.nus.edu.sg/handle/10635/103925 | |
dc.description.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. | |
dc.source | Scopus | |
dc.type | Article | |
dc.contributor.department | MATHEMATICS | |
dc.description.sourcetitle | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
dc.description.volume | 2898 | |
dc.description.page | 183-189 | |
dc.identifier.isiut | NOT_IN_WOS | |
Appears in Collections: | Staff Publications |
Show simple item record
Files in This Item:
There are no files associated with this item.
Google ScholarTM
Check
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.