Proof of Massey's conjectured algorithm
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Extension of the Berlekamp-Massey algorithm to N dimensions
Information and Computation
Finite fields
Introduction to Coding Theory
Linear complexity of transformed sequences
EUROCODE '90 Proceedings of the International Symposium on Coding Theory and Applications
Lower Bounds on the Weight Complexities of Cascaded Binary Sequences
AUSCRYPT '90 Proceedings of the International Conference on Cryptology: Advances in Cryptology
The expected value of the joint linear complexity of periodic multisequences
Journal of Complexity
Error linear complexity measures for multisequences
Journal of Complexity
Proof of a conjecture on the joint linear complexity profile of multisequences
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Expected value of the linear complexity of two-dimensional binary sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Asymptotic behavior of normalized linear complexity of multi-sequences
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
The probabilistic theory of the joint linear complexity of multisequences
SETA'06 Proceedings of the 4th international conference on Sequences and Their Applications
Periodic sequences with large k-error linear complexity
IEEE Transactions on Information Theory
On the lattice basis reduction multisequence synthesis algorithm
IEEE Transactions on Information Theory
Enumeration results on the joint linear complexity of multisequences
Finite Fields and Their Applications
Multisequences with large linear and k-error linear complexity from Hermitian function fields
IEEE Transactions on Information Theory
The minimal polynomial over Fq of linear recurring sequence over Fqm
Finite Fields and Their Applications
Improved results on periodic multisequences with large error linear complexity
Finite Fields and Their Applications
| Hi-index | 0.06 |
Generalizing the theory of k-error linear complexity for single sequences over a finite field, Meidl et al. (J. Complexity 23(2), 169---192 (2007)) introduced three possibilities of defining error linear complexity measures for multisequences. A good keystream sequence must possess a large linear complexity and a large k-error linear complexity simultaneously for suitable values of k. In this direction several results on the existence, and lower bounds on the number, of single sequences with large k-error linear complexity were proved in Meidl and Niederreiter (Appl. Algebra Eng. Commun. Comput. 14(4), 273---286 (2003)), Niederreiter (IEEE Trans. Inform. Theory 49(2), 501---505 (2003)) and Niederreiter and Shparlinski (In: Paterson (ed.) 9th IMA International Conference on Cryptography and Coding (2003)). In this paper we discuss analogous results for the case of multisequences. We also present improved bounds on the error linear complexity and on the number of sequences satisfying such bounds for the case of single sequences.