On periodic sequences of the maximum linear complexity and M-sequences

Abstract

This paper gives another proof of a maximum linear complexity property of the periodic sequences over GF(q) of period T=q/sup m/-1 obtained by the minimum changes of an m-sequence, and shows that the converse is also true if the period T=q/sup m/-1 is a prime number.<>