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.868492
DC FieldValue
dc.titleA fast algorithm for determining the linear complexity of a sequence with period p n over G F (q)
dc.contributor.authorXiao, G.
dc.contributor.authorWei, S.
dc.contributor.authorLam, K.Y.
dc.contributor.authorImamura, K.
dc.date.accessioned2013-07-04T07:33:11Z
dc.date.available2013-07-04T07:33:11Z
dc.date.issued2000
dc.identifier.citationXiao, G.,Wei, S.,Lam, K.Y.,Imamura, K. (2000). A fast algorithm for determining the linear complexity of a sequence with period p n over G F (q). IEEE Transactions on Information Theory 46 (6) : 2203-2206. ScholarBank@NUS Repository. <a href="https://doi.org/10.1109/18.868492" target="_blank">https://doi.org/10.1109/18.868492</a>
dc.identifier.issn00189448
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/39066
dc.description.abstractA fast algorithm is presented for determining the linear complexity of a sequence with period p n over GF (q), where p is an odd prime, and where q is a prime and a primitive root (mod p 2). © 2000 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/18.868492
dc.sourceScopus
dc.subjectCodes
dc.subjectCryptography
dc.subjectFast algorithm
dc.subjectLinear complexity
dc.subjectPeriodic sequence
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/18.868492
dc.description.sourcetitleIEEE Transactions on Information Theory
dc.description.volume46
dc.description.issue6
dc.description.page2203-2206
dc.description.codenIETTA
dc.identifier.isiutNOT_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

Altmetric


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