1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1109/18.669398
DC FieldValue
dc.titleOn the linear complexity of Legendre sequences
dc.contributor.authorDing, C.
dc.contributor.authorHelleseth, T.
dc.contributor.authorShan, W.
dc.date.accessioned2014-10-27T06:03:25Z
dc.date.available2014-10-27T06:03:25Z
dc.date.issued1998
dc.identifier.citationDing, C., Helleseth, T., Shan, W. (1998). On the linear complexity of Legendre sequences. IEEE Transactions on Information Theory 44 (3) : 1276-1278. ScholarBank@NUS Repository. https://doi.org/10.1109/18.669398
dc.identifier.issn00189448
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/99364
dc.description.abstractIn this correspondence we determine the linear complexity of all Legendre sequences and the (monic) feedback polynomial of the shortest linear feedback shift register that generates such a Legendre sequence. The result of this correspondence shows that Legendre sequences are quite good from the linear complexity viewpoint. © 1998 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/18.669398
dc.sourceScopus
dc.subjectCodes
dc.subjectCryptography
dc.subjectLegendre sequence
dc.subjectSequence
dc.typeArticle
dc.contributor.departmentINFORMATION SYSTEMS & COMPUTER SCIENCE
dc.description.doi10.1109/18.669398
dc.description.sourcetitleIEEE Transactions on Information Theory
dc.description.volume44
dc.description.issue3
dc.description.page1276-1278
dc.description.codenIETTA
dc.identifier.isiut000073200100034
Appears in Collections:Staff Publications

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

Google ScholarTM

Check

Altmetric


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