A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields
Xianhua Niu, Chaoping Xing, Yang Liu, Liang Zhou
Abstract
In literatures, there are various constructions of frequency hopping sequence (FHS for short) sets with good Hamming correlations. Some papers employed only multiplicative groups of finite fields to construct FHS sets, while other papers implicitly used only additive groups of finite fields for construction of FHS sets. In this paper, we make use of both multiplicative and additive groups of finite fields simultaneously to present a construction of optimal FHS sets. The construction provides a new family of optimal (q <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m</sup> - 1, q <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m-t</sup> -1/r , rq <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">t</sup> ; q <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">m-t</sup> -1/r + 1) frequency hopping sequence sets archiving the Peng-Fan bound. Thus, some FHS sets constructed in literatures using either multiplicative groups or additive groups of finite fields are included in our family. In addition, some other FHS sets can be obtained via the well-known recursive construction through one-coincidence sequence set.