Please use this identifier to cite or link to this item: https://doi.org/10.1109/18.796414
DC FieldValue
dc.titleSeveral classes of binary sequences with three-level autocorrelation
dc.contributor.authorDing, C.
dc.contributor.authorHelleseth, T.
dc.contributor.authorLam, K.Y.
dc.date.accessioned2013-07-04T07:29:40Z
dc.date.available2013-07-04T07:29:40Z
dc.date.issued1999
dc.identifier.citationDing, C., Helleseth, T., Lam, K.Y. (1999). Several classes of binary sequences with three-level autocorrelation. IEEE Transactions on Information Theory 45 (7) : 2606-2612. ScholarBank@NUS Repository. https://doi.org/10.1109/18.796414
dc.identifier.issn00189448
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/38910
dc.description.abstractIn this correspondence we describe several classes of binary sequences with three-level autocorrelation. Those classes of binary sequences are based on cyclic almost difference sets. Some classes of binary sequences have optimum autocorrelation. © 1999 IEEE.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1109/18.796414
dc.sourceScopus
dc.subjectAlmost difference set
dc.subjectCyclotomy
dc.subjectSequence
dc.typeArticle
dc.contributor.departmentCOMPUTER SCIENCE
dc.description.doi10.1109/18.796414
dc.description.sourcetitleIEEE Transactions on Information Theory
dc.description.volume45
dc.description.issue7
dc.description.page2606-2612
dc.description.codenIETTA
dc.identifier.isiut000083159300050
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

100
checked on Jul 1, 2022

WEB OF SCIENCETM
Citations

86
checked on Jun 23, 2022

Page view(s)

223
checked on Jun 23, 2022

Google ScholarTM

Check

Altmetric


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