Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
P. Udaya, Mohammad Umar Siddiqi · IEEE Transactions on Information Theory · 1998
We construct new sequences over finite rings having optimal Hamming correlation properties. These sequences are useful in frequency hopping multiple-access (FHMA) spread-spectrum communication systems. Our constructions can be classified into linear and nonlinear categories, both giving optimal Hamming correlations according to Lempel-Greenberger (1974) bound. The nonlinear sequences have large linear complexity and can be seen as a generalized version of GMW sequences over fields.