In: Advanced Math
a.
Linear complexity is also called linear span.If an LFSR sequence
of n stages has the maximal period 
 ,then it is called a maximal length sequence,shortened as m -
sequence.
b.
One standed wa is as follows.Let, n primitive LFSR with lengths
with 
, 
now we take the GCD 
and take a nonlinear boolean function 
with 
for that we have a output of linear complexity 
evaluted over the integers, where output of LFSR 
 is input as the variable 
 of the bolean function.this is called the combination
generator,
example.