On the Linear Complexity of Chung-Yang Sequences over GF(q)
Fang Liu, Daiyuan Peng · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2011
In this letter, we determine the linear complexity and minimum polynomial of the frequency hopping sequences over GF(q) introduced by Chung and Yang, where q is an odd prime. The results of this letter show that these sequences are quite good from the linear complexity viewpoint. By modifying these sequences, another class of frequency hopping sequences are obtained. The modified sequences also have low Hamming autocorrelation and large linear complexity.