A randomness conserved exponential mapping of a GF(q) m-sequence

Proposes an exponential nonlinear mapping of the maximum length sequence (M-sequence) over GF(q) which not only increases the linear complexity but also conserves the randomness and period length of the input sequence. For the properly chosen exponent of the exponential operation one-to-one mapping can be obtained to keep the balance, run, and long period properties of the input sequence. Calculations of the linear complexity provided by the exponential nonlinear mapping with the q-ary m-sequence are discussed by the trace representation method and the combinatorial theorem over GF(q).<
>