| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 720702 | The Journal of China Universities of Posts and Telecommunications | 2013 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Engineering
Electrical and Electronic Engineering
