Publication Type:

Journal Article




<p>The joint linear complexity and k-error joint linear complexity of an m-fold 2n&nbsp;periodic multisequence can be efficiently computed using Modified Games Chan algorithm&nbsp;and Extended Stamp Martin Algorithm respectively. In this chapter the authors derive an&nbsp;algorithm which, given a constant c and an m–fold 2n periodic binary multisequence S,&nbsp;computes the minimum number k of errors and the associated error multisequence needed&nbsp;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.2<sup>v</sup> periodic binary multisequence.</p>

Cite this Research Publication

Dr. Sindhu M. and Dr. M. Sethumadhavan, “Error Linear Complexity Measures of Binary Multisequences”, 2011.