Optimal large linear complexity frequency hopping patterns derived from polynomial residue class rings
We construct new sequences over finite rings having optimal Hamming correlation properties. These sequences are useful in frequency hopping multiple-access (FHMA) spreadspectrum communication systems. Our constructions can be classified into linear and nonlinear categories, both giving optimal Hammi...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | Article |
| 语言: | English |
| 出版: |
Institute of Electrical and Electronics Engineers Inc.
1998
|
| 主题: | |
| 在线阅读: | http://irep.iium.edu.my/14019/1/Optimal_Large_Linear_Complexity_Frequency_Hopping_Patterns_Derived_from_Polynomial_Residue_Class_Rings.pdf http://irep.iium.edu.my/14019/ http://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=681324&sortType%3Dasc_p_Sequence%26filter%3DAND%28p_IS_Number%3A14976%29 |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
| 总结: | We construct new sequences over finite rings having optimal Hamming correlation properties. These sequences are useful in frequency hopping multiple-access (FHMA) spreadspectrum communication systems. Our constructions can be classified into linear and nonlinear categories, both giving optimal Hamming correlations according to Lempel-Greenberger bound. The nonlinear sequences have large linear complexity and can be seen as a generalized version of GMW sequences over fields |
|---|