New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions

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.