利用有限域的乘加群构造最优跳频序列集
A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields
摘要:
文献中给出了各种具有良好汉明相关性的跳频序列集的构造方法。有些论文只使用有限域的乘法群来构造FHS集,而另一些论文则隐式地使用有限域的加法群来构造FHS集。本文同时利用有限域的乘法群和加法群,给出了最优FHS集的一种构造方法。该构造提供了一族新的满足Peng-Fan界的最优$\left(q^m-1,\frac{q^{m-t}-1}{r},rq^t;\frac{q^{m-t}-1}{r}+1\right)$跳频序列集。因此,文献中利用有限域的乘法群或加法群构造的FHS集都包含在我们的族中。此外,通过单重合序列集的递归构造,还可以得到其它一些FHS集。
英文摘要:
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 $\left(q^m-1,\frac{q^{m-t}-1}{r},rq^t;\frac{q^{m-t}-1}{r}+1\right)$ frequency hopping sequence sets archiving the Peng-Fan bound. Thus, the FHS sets constructed in literatures using either multiplicative groups or additive groups of finite fields are all included in our family. In addition, some other FHS sets can be obtained via the well-known recursive constructions through one-coincidence sequence set.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。