Computing the k-error joint linear complexity of binary periodic multisequences

摘要

Complexity measures for multisequences over finite fields,such as the joint linear complexity and the k-error joint linear complexity,play an important role in cryptology.In this paper we study a fast algorithm,presented by Venkateswarlu A,to computer the k-error joint linear complexity of a binary periodic multisequence.In this paper,the aim is mainly to complement the theoretical derivation and proof of the existing algorithm.Moreover,our algorithm reduces computation.