Frequency-hopping code sequence designs having large linear span
IEEE Transactions on Information Theory
Spread spectrum communications handbook (revised ed.)
Spread spectrum communications handbook (revised ed.)
New M-ary sequence families with low correlation and large size
IEEE Transactions on Information Theory
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: a combinatorial approach
IEEE Transactions on Information Theory
Optimal frequency-hopping sequences via cyclotomy
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Cross Correlation of Sidel'nikov Sequences and Their Constant Multiples
IEEE Transactions on Information Theory
Algebraic Constructions of Optimal Frequency-Hopping Sequences
IEEE Transactions on Information Theory
Sets of Optimal Frequency-Hopping Sequences
IEEE Transactions on Information Theory
New Families of -Ary Sequences With Low Correlation Constructed From Sidel'nikov 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
New families of frequency-hopping sequences of length mN derived from the k-fold cyclotomy
SETA'10 Proceedings of the 6th international conference on Sequences and their applications
New designs of frequency hopping sequences with low hit zone
Designs, Codes and Cryptography
Low-Hit-Zone frequency-hopping sequence sets with new parameters
SETA'12 Proceedings of the 7th international conference on Sequences and Their Applications
| Hi-index | 754.96 |
A (v, l, λ)-FHS denotes a frequency-hopping sequence of length v over a frequency set of size l with maximum out-of-phase Hamming autocorrelation λ. Recently, Ding and Yin constructed two FHS families for a prime power q satisfying q = ef + 1 with positive integers e and f. Theorems 4 and 5 in their paper claim that these two FHS families include optimal (q - 1, e, f)-FHSs and (q - 1, e + 1, f - 1)-FHSs with respect to the Lempel-Greenberger bound, respectively. In this paper, we give counterexamples and make corrections to them. Furthermore, we observe that these FHSs are closely related to Sidel'nikov sequences. Based on our results on the spectrum of their Hamming autocorrelation values, we also correct the theorem on the spectrum of Hamming distances of nearly equidistant codes derived by Sidel'nikov.