Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.jco.2004.09.001
DC FieldValue
dc.titleOn the joint linear complexity profile of explicit inversive multisequences
dc.contributor.authorMeidl, W.
dc.contributor.authorWinterhof, A.
dc.date.accessioned2016-12-13T05:36:15Z
dc.date.available2016-12-13T05:36:15Z
dc.date.issued2005-06
dc.identifier.citationMeidl, W., Winterhof, A. (2005-06). On the joint linear complexity profile of explicit inversive multisequences. Journal of Complexity 21 (3) : 324-336. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jco.2004.09.001
dc.identifier.issn0885064X
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/132764
dc.description.abstractWe prove lower bounds on the joint linear complexity profile of multisequences obtained by explicit inversive methods and show that for some suitable choices of parameters these joint linear complexity profiles are close to be perfect. © 2004 Elsevier Inc. All rights reserved.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1016/j.jco.2004.09.001
dc.sourceScopus
dc.subjectInversive method
dc.subjectLinear complexity profile
dc.subjectMultisequences
dc.subjectNonlinear pseudorandom numbers
dc.subjectParallelization
dc.typeArticle
dc.contributor.departmentTEMASEK LABORATORIES
dc.description.doi10.1016/j.jco.2004.09.001
dc.description.sourcetitleJournal of Complexity
dc.description.volume21
dc.description.issue3
dc.description.page324-336
dc.identifier.isiut000229443200005
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

11
checked on Dec 1, 2021

WEB OF SCIENCETM
Citations

10
checked on Dec 1, 2021

Page view(s)

45
checked on Dec 2, 2021

Google ScholarTM

Check

Altmetric


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