New upper bounds on the linear complexity

AbstractIn this work, the general upper bound on the linear complexity given by Key is improved for certain families of nonlinear filter functions. Also, a new class of cyclotomic cosets whose degeneration is relatively easy to prove in several conditions is introduced and analysed