We prove a conjecture on the asymptotic behavior of the joint linear complexity profile of random multisequences over a finite field. This conjecture was previously shown only in the special cases of single sequences and pairs of sequences. We also establish an asymptotic formula for the expected value of the
th joint linear complexity of random multisequences over a finite field. These results are relevant for the theory of word-based stream ciphers.