The Asymptotic Normalized Linear Complexity of Multisequences

Details The Asymptotic Normalized Linear Complexity of Multisequences The Asymptotic Normalized Linear Complexity of Multisequences

2007-05-29

arxiv.org/abs/0705.4138v1

Computer Science

Information Theory

19 pages, 2 figures, submitted to J. Complexity

Scientific paper

We show that the asymptotic linear complexity of a multisequence a in F_q^\infty that is I := liminf L_a(n)/n and S := limsup L_a(n)/n satisfy the inequalities M/(M+1) <= S <= 1 and M(1-S) <= I <= 1-S/M, if all M sequences have nonzero discrepancy infinitely often, and all pairs (I,S) satisfying these conditions are met by 2^{\aleph_0} multisequences a. This answers an Open Problem by Dai, Imamura, and Yang. Keywords: Linear complexity, multisequence, Battery Discharge Model, isometry.

Affiliated with

Also associated with

No associations

Rating

The Asymptotic Normalized Linear Complexity of Multisequences does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Asymptotic Normalized Linear Complexity of Multisequences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Asymptotic Normalized Linear Complexity of Multisequences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-498941