Generalized Joint Linear Complexity of Linear Recurring Multisequences
Wilfried Meidl 1 and Ferruh ¨ Ozbudak 2
1
Faculty of Engineering and Natural Sciences, Sabancı University, Tuzla, 34956, ˙Istanbul, Turkey
wmeidl@sabanciuniv.edu
2
Tam metin
1
2
Benzer Belgeler
Ding, Linear complexity of generalized cyclotomic binary sequences of order 2, Finite Fields Appl. Ding, Autocorrelation values of generalized cyclotomic sequences of order two,
[3] Ding, C.: A fast algorithm for the determination of the linear complexity of sequences over GF(p m ) with period p n , in: The Stability Theory of Stream Ciphers, Lecture Notes
In this contribution we initiate the construction of algorithms for the calculation of the linear complexity in the more general viewpoint of sequences in M(f ) for arbitrary
After recalling some basic facts and techniques in Section 2, in Section 3 we establish good lower bounds on the linear complexity for several classes of sequences of the form
Similarly, two different purely periodic m-fold multisequences S and S 0 with column vectors in F m q and with joint linear complexity at most L differ at least once at any
an exact formula for the expected 1-error linear complexity and upper and lower bounds for the expected k-error linear complexity, k ≥ 2, of a random 2 n -periodic binary sequence..
For the ternary case we present exact results on the linear complexity using well known results on cyclotomic numbers.. Moreover, we prove a general lower bound on the linear
Joints; According to Structure.. A-) According to the number of bone forming the joint;