Spread spectrum communications handbook (revised ed.)
Spread spectrum communications handbook (revised ed.)
On the Sidel'nikov sequences as frequency-hopping sequences
IEEE Transactions on Information Theory
New classes of optimal frequency-hopping sequences by interleaving techniques
IEEE Transactions on Information Theory
Optimal frequency-hopping sequences with new parameters
IEEE Transactions on Information Theory
Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences
IEEE Transactions on Information Theory
Optimal frequency-hopping sequences via cyclotomy
IEEE Transactions on Information Theory
Sets of Optimal Frequency-Hopping Sequences
IEEE Transactions on Information Theory
Theory and applications of q-ary interleaved sequences
IEEE Transactions on Information Theory
New Generalized Cyclotomy and Its Applications
Finite Fields and Their Applications
Hi-index | 0.00 |
Let N = p1 ... pk where pi, 1 ≤ i ≤ k, are odd primes such that p1 pk and pi = Mif + 1 for some positive integers Mi and f. In this paper, we construct frequency-hopping sequence (FHS) sets by using the properties of the k-fold cycltomy. We give FHS sets with length 2N and frequency set size (N - 1)/f, which are optimal with respect to the Peng-Fan bound if k = 1, and near-optimal if k ≥ 2. We also present near-optimal FHS sets with length mN and frequency set size (N - 1)/f + 1 for any integer m with 2 ≤ m ≤ M1. The FHS sets constructed in this paper have new parameters not covered in the literature.