Two Classes of Optimal Frequency Hopping Sequences with New Parameters

Frequency hopping sequences (FHSs) play a crucial role in wireless communication, while Reed-Solomon (RS) codes hold a good algebraic structure. In this paper, two classes of FHSs are constructed from punctured RS codes, both containing new parameters. The two classes of FHSs both meet the lower bound of peak nontrivial Hamming correlation given by (3), and under certain constraints both classes can meet the upper bound of set size given by (2). Moreover, the methods in this paper can be regarded as a generalization of some previous methods.