An algorithm fork-error joint linear complexity of binary multisequences
Madathil Sethumadhavan, M. Sindhu, Chungath Srinivasan, C. Kavitha · Journal of Discrete Mathematical Sciences and Cryptography · 2008
Our aim is to find some of the analogues of results related to k-error linear complexity of single sequences to the case of multisequences over GF(2). This paper presents algorithms for finding the joint linear complexity and the k-error joint linear complexity of m-fold binary multisequences of period 2 n .