Improved results on periodic multisequences with large error linear complexity

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.

[1]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

[2]  Ed Dawson,et al.  Analysis and Design Issues for Synchronous Stream Ciphers , 2002 .

[3]  Harald Niederreiter,et al.  Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences , 2005, INDOCRYPT.

[4]  Arne Winterhof,et al.  On the k-error linear complexity over $$\mathbb{F}_p$$ of Legendre and Sidelnikov sequences , 2006, Des. Codes Cryptogr..

[5]  Guang Gong,et al.  New results on periodic sequences with large k-error linear complexity , 2008, 2008 IEEE International Symposium on Information Theory.

[6]  Harald Niederreiter,et al.  Linear Complexity and Related Complexity Measures for Sequences , 2003, INDOCRYPT.

[7]  Ayineedi Venkateswarlu,et al.  Error linear complexity measures for multisequences , 2007, J. Complex..

[8]  R. Blahut.  Algebraic Codes for Data Transmission , 2002 .

[9]  Rudolf Lide,et al.  Finite fields , 1983 .

[10]  Harald Niederreiter.  Coding Theory and Cryptology , 2002 .

[11]  Igor E. Shparlinski,et al.  Periodic Sequences with Maximal Linear Complexity and Almost Maximal k-Error Linear Complexity , 2003, IMACC.

[12]  Harald Niederreiter,et al.  Periodic sequences with large k-error linear complexity , 2003, IEEE Trans. Inf. Theory.

[13]  Harald Niederreiter,et al.  On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences , 2002, IEEE Trans. Inf. Theory.

[14]  Harald Niederreiter,et al.  The Asymptotic Behavior of the Joint Linear Complexity Profile of Multisequences , 2007 .

[15]  Cunsheng Ding,et al.  The Stability Theory of Stream Ciphers , 1991, Lecture Notes in Computer Science.

[16]  Harald Niederreiter,et al.  Periodic Sequences with Maximal Linear Complexity and Large k-Error Linear Complexity , 2003, Applicable Algebra in Engineering, Communication and Computing.

[17]  T. Apostol.  Introduction to analytic number theory , 1976 .

[18]  Ayineedi Venkateswarlu,et al.  Periodic multisequences with large error linear complexity , 2008, Des. Codes Cryptogr..

[19]  Philip Hawkes,et al.  Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers , 2000, ASIACRYPT.

[20]  Harald Niederreiter,et al.  The expected value of the joint linear complexity of periodic multisequences , 2003, J. Complex..