An efficient algorithm is presented for computing the k-errorlinearcomplexity of a binarysequence with period p~n,where 2 is a primitive root modulo *** new algorithm is a generalization of an algorithm over a bina...
详细信息
An efficient algorithm is presented for computing the k-errorlinearcomplexity of a binarysequence with period p~n,where 2 is a primitive root modulo *** new algorithm is a generalization of an algorithm over a binary field presented by Xiao,Wei,Imamura and Lam.
暂无评论