On the joint linear complexity profile of explicit inversive multisequences

We prove lower bounds on the joint linear complexity profile of multisequences obtained by explicit inversive methods and show that for some suitable choices of parameters these joint linear complexity profiles are close to be perfect.