Error Linear Complexity Measures of Binary Multisequences

The joint linear complexity and k - error joint linear complexity of an m - fold 2n periodic multisequence can be efficiently computed using Modified Games Chan algorithm and Extended Stamp Martin Algorithm respectively. In this chapter the authors derive an algorithm which, given a constant c and an m – fold 2n periodic binary multisequence S, computes the minimum number k of errors and the associated error multisequence needed over a period of S for bringing the joint linear complexity of S below c . They derived another algorithm for finding the joint linear complexity of 3. 2v periodic binary multisequence.