Improved results on periodic multisequences with large error linear complexity

Authors:
Ayineedi Venkateswarlu;Harald Niederreiter
Affiliations:
C. R. Rao AIMSCS, University of Hyderabad Campus, Prof. C. R. Rao Road, Gachibowli, Hyderabad-500046, India;Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstraíe 69, A-4040 Linz, Austria
Venue:
Finite Fields and Their Applications
Year:
2010

Citing 10
Cited 1

Finite fields

Finite fields
Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers

ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The expected value of the joint linear complexity of periodic multisequences

Journal of Complexity
On the k-error linear complexity over $$\mathbb{F}_p$$ of Legendre and Sidelnikov sequences

Designs, Codes and Cryptography
Error linear complexity measures for multisequences

Journal of Complexity
Periodic multisequences with large error linear complexity

Designs, Codes and Cryptography
New results on periodic sequences with large k-error linear complexity

IEEE Transactions on Information Theory
Proof of a conjecture on the joint linear complexity profile of multisequences

INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
On the expected value of the linear complexity and the k-error linear complexity of periodic sequences

IEEE Transactions on Information Theory
Periodic sequences with large k-error linear complexity

IEEE Transactions on Information Theory

Periodic sequences with maximal N-adic complexity and large k-error N-adic complexity over Z/(N)

Journal of Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

For multisequences there are various possibilities of defining analogs of the k-error linear complexity of single sequences. We consider the k-error joint linear complexity, the k-error F"q-linear complexity, and the k--error joint linear complexity. Improving the existing results, several results on the existence of, and lower bounds on the number of, multisequences with large error linear complexity are obtained. Improved lower bounds are shown for the case of prime-power periodic multisequences. An asymptotic analysis for the prime-power period case is carried out.