Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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.
['P. Udaya', 'Mohammad Umar Siddiqi']
I am writing a research paper on a idea Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
[{"from": "human", "value": "I am writing a research paper on a idea Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  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."}]