Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.jco.2004.09.001
Title: On the joint linear complexity profile of explicit inversive multisequences
Authors: Meidl, W. 
Winterhof, A. 
Keywords: Inversive method
Linear complexity profile
Multisequences
Nonlinear pseudorandom numbers
Parallelization
Issue Date: Jun-2005
Citation: Meidl, 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
Abstract: We 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.
Source Title: Journal of Complexity
URI: http://scholarbank.nus.edu.sg/handle/10635/132764
ISSN: 0885064X
DOI: 10.1016/j.jco.2004.09.001
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

10
checked on Jul 16, 2018

WEB OF SCIENCETM
Citations

10
checked on Jul 16, 2018

Page view(s)

4
checked on Mar 12, 2018

Google ScholarTM

Check

Altmetric


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