Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.ffa.2009.03.001
Title: Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences
Authors: Fu, F.-W.
Niederreiter, H. 
Özbudak, F.
Keywords: Joint linear complexity
Linear recurring sequences
Multisequences
Issue Date: Aug-2009
Citation: Fu, F.-W., Niederreiter, H., Özbudak, F. (2009-08). Joint linear complexity of arbitrary multisequences consisting of linear recurring sequences. Finite Fields and their Applications 15 (4) : 475-496. ScholarBank@NUS Repository. https://doi.org/10.1016/j.ffa.2009.03.001
Abstract: Let g1, ..., gs ∈ Fq [x] be arbitrary nonconstant monic polynomials. Let M (g1, ..., gs) denote the set of s-fold multisequences (σ1, ..., σs) such that σi is a linear recurring sequence over Fq with characteristic polynomial gi for each 1 ≤ i ≤ s. Recently, we obtained in some special cases (for instance when g1, ..., gs are pairwise coprime or when g1 = ⋯ = gs) the expectation and the variance of the joint linear complexity of random multisequences that are uniformly distributed over M (g1, ..., gs). However, the general case seems to be much more complicated. In this paper we determine the expectation and the variance of the joint linear complexity of random multisequences that are uniformly distributed over M (g1, ..., gs) in the general case. © 2009 Elsevier Inc. All rights reserved.
Source Title: Finite Fields and their Applications
URI: http://scholarbank.nus.edu.sg/handle/10635/103455
ISSN: 10715797
DOI: 10.1016/j.ffa.2009.03.001
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

5
checked on May 28, 2018

WEB OF SCIENCETM
Citations

4
checked on Apr 23, 2018

Page view(s)

32
checked on Mar 12, 2018

Google ScholarTM

Check

Altmetric


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