Journal article
New bound on frequency hopping sequence sets and its optimal constructions
Y Yang, X Tang, U Parampalli, D Peng
IEEE Transactions on Information Theory | Published : 2011
Abstract
In this paper, we derive a new bound on maximum nontrivial Hamming correlation of frequency hopping (FH) sequences from the Singleton bound in error correcting code literature, and we discuss the relation between the new bound and the known ones on FH sequences. Further, we construct two classes of FH sequences from punctured Reed-Solomon codes and one class of FH sequences from polynomial functions, which meet the new bound. © 2011 IEEE.
Grants
Awarded by National Natural Science Foundation of China
Funding Acknowledgements
Y. Yang and X. Tang were supported in part by the National Science Foundation of China (NSFC) under Grant 60772086 and in part by the Australia-China Special Fund under Grant 61011120055. U. Parampalli was supported in part by the Australia-China Special Fund for S & T Cooperation, Department of Innovation, Industry, Science and Research (DIISR) Australia, under Grant CH090262. D. Peng was supported in part by the NSFC under Grant 60872015.