Multi-sequences with almost perfect linear complexity profile and function fields over finite fields

Sequences with almost perfect linear complexity profile defined by Niederreiter (1997, Lecture Notes in Computer Science, Vol. 304, pp. 37-51, Springer-Verlag, Berlin/New York) are guile important for stream ciphers. In this paper, we investigate multi-sequences with almost perfect linear complexity profile and obtain a construction of such multi-sequences by using function fields over finite fields. Some interesting examples from this construction are presented to illustrate our construction. (C) 2000 Academic Press.