On the linear complexity of nonuniformly decimated PN-sequences

A lower bound is derived on the probability that when a PN-sequence of period N=2/sup n/-1 is nonuniformly decimated by means of a sequence whose period divides M, the decimated sequence will have maximum linear complexity nM. It is shown that by choosing M and n appropriately, this probability can be made arbitrarily close to one with nM arbitrarily large. >