A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields

12/21/2018
by   Xianhua Niu, et al.
0

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^m-1,q^m-t-1/r,rq^t;q^m-t-1/r+1) 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/13/2019

Construction of three classes of Strictly Optimal Frequency-Hopping Sequence Sets

In this paper, we construct three classes of strictly optimal frequency-...
research
06/26/2018

New extension constructions of optimal frequency hopping sequence sets

In this paper, a general framework of constructing optimal frequency hop...
research
07/21/2023

Improved Approximate Distance Oracles: Bypassing the Thorup-Zwick Bound in Dense Graphs

Despite extensive research on distance oracles, there are still large ga...
research
05/06/2019

Two constructions of asymptotically optimal codebooks via the trace functions

In this paper, we present two new constructions of complex codebooks wit...
research
11/01/2019

Six constructions of asymptotically optimal codebooks via the character sums

In this paper, using additive characters of finite field, we find a code...
research
06/13/2019

New constructions of asymptotically optimal codebooks via character sums over a local ring

In this paper, we present explicit description on the additive character...
research
06/22/2018

Acyclicity in finite groups and groupoids

We expound a simple construction of finite groups and groupoids whose Ca...

Please sign up or login with your details

Forgot password? Click here to reset