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

作　　者：LI Fu-lin ZHU Shi-xin 

机构地区：[1]School of Mathematics, Hefei University of Technology

出　　处：《The Journal of China Universities of Posts and Telecommunications》2013年第6期96-101,共6页中国邮电高校学报（英文版）

基　　金：supported by the National Natural Science Foundation of China (61370089);the Fundamental Research Funds for the Central Universities (2012HGBZ0622)

摘　　要：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.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.

关 键 词：CRYPTOLOGY multisequence algorithm joint linear complexity k-error joint linear complexity 

分 类 号：TN918.1[电子电信—通信与信息系统]