Improved results on periodic multisequences with large error linear complexity (Q609363): Difference between revisions

In [\textit{W. Meidl, H. Niederreiter} and \textit{A. Venkateswarlu}, J. Complexity 23, No. 2, 169--192 (2007; Zbl 1128.94007); \textit{H. Niederreiter}, Lect. Notes Comput. Sci. 2904, 1--17 (2003; Zbl 1123.94331); \textit{H. Niederreiter} and \textit{A. Venkateswarlu}, Des. Codes Cryptography 49, No. 1--3, 33--45 (2008; Zbl 1179.94056); \textit{H. Niederreiter} and \textit{L.-P. Wang}, Lecture Notes in Computer Science 3797, 13--22 (2005; Zbl 1153.94338); \textit{H. Niederreiter} and \textit{L.-P. Wang}, Monatsh. Math. 150, No. 2, 141--155 (2007; Zbl 1121.94018)], complexity measures of multisequences have been considered. In this paper the study of the complexities for multisequences with large error linear complexity are continued. In the case of prime-power periodic multisequences some refined lower bounds on the number of such sequences are presented. Moreover, an asymptotic analysis of prime-power period shows the existence of multisequence with large complexity.