Designs, Codes and Cryptography

, Volume 83, Issue 1, pp 219–232 | Cite as

Three new classes of optimal frequency-hopping sequence sets

  • Bocong Chen
  • Liren Lin
  • San Ling
  • Hongwei LiuEmail author


The study of frequency-hopping sequences (FHSs) has been focused on the establishment of theoretical bounds for the parameters of FHSs as well as on the construction of optimal FHSs with respect to the bounds. Peng and Fan (IEEE Trans Inf Theory 50(9):2149–2154, 2004) derived two lower bounds on the maximum nontrivial Hamming correlation of an FHS set, which is an important indicator in measuring the performance of an FHS set employed in practice. In this paper, we obtain two main results. We study the construction of new optimal frequency-hopping sequence sets by using cyclic codes over finite fields. Let \(\mathcal {C}\) be a cyclic code of length n over a finite field \(\mathbb {F}_q\) such that \(\mathcal {C}\) contains the one-dimensional subcode \( \mathcal {C}_0=\{(\alpha ,\alpha ,\ldots ,\alpha )\in \mathbb {F}_q^n\,|\,\alpha \in \mathbb {F}_q\}. \) Two codewords of \(\mathcal {C}\) are said to be equivalent if one can be obtained from the other through applying the cyclic shift a certain number of times. We present a necessary and sufficient condition under which the equivalence class of any codeword in \(\mathcal {C}\setminus \mathcal {C}_0\) has size n. This result addresses an open question raised by Ding et al. (IEEE Trans Inf Theory 55(7):3297–3304, 2009). As a consequence, three new classes of optimal FHS sets with respect to the Singleton bound are obtained, some of which are also optimal with respect to the Peng–Fan bound at the same time. We also show that the two Peng–Fan bounds are, in fact, identical.


Frequency-hopping sequence set Cyclic code Maximum distance separable (MDS) code Cyclotomic coset 

Mathematics Subject Classification

94A55 94B05 



The authors are grateful to the three anonymous reviewers for their helpful comments and suggestions that improved an earlier version of this paper. The research of the first and third authors was partially supported by NTU Research Grant M4080456. The fourth author was supported by NSFC (Grant No. 11171370) and self-determined research funds of CCNU from the colleges’s basic research and operation of MOE (Grant No. CCNU14F01004). Part of this work was done when B. Chen was with Nanyang Technological University.


  1. 1.
    Cai H., Zhou Z., Yang Y., Tang X.: A new construction of frequency-hopping sequences with optimal partial Hamming correlation. IEEE Trans. Inf. Theory 60(9), 5782–5790 (2014).Google Scholar
  2. 2.
    Chen B., Ling S., Zhang G.: Application of constacyclic codes to quantum MDS codes. IEEE Trans. Inf. Theory 61(3), 1474–1484 (2015).Google Scholar
  3. 3.
    Chu W., Colbourn C.J.: Optimal frequency-hopping sequences via cyclotomy. IEEE Trans. Inf. Theory 51(3), 1139–1141 (2005).Google Scholar
  4. 4.
    Chung J.-H., Yang K.: Optimal frequency-hopping sequences with new parameters. IEEE Trans. Inf. Theory 56(4), 1685–1693 (2010).Google Scholar
  5. 5.
    Chung J.-H., Yang K.: \(k\)-fold cyclotomy and its application to frequency-hopping sequences. IEEE Trans. Inf. Theory 57(4), 2306–2317 (2011).Google Scholar
  6. 6.
    Chung J.-H., Yang K.: A new class of balanced near-perfect nonlinear mapping and its application to sequence design. IEEE Trans. Inf. Theory 59(2), 1090–1097 (2013).Google Scholar
  7. 7.
    Chung J.-H., Gong G., Yang K.: New families of optimal frequency-hopping sequences of composite lengths. IEEE Trans. Inf. Theory 60(6), 3688–3697 (2014).Google Scholar
  8. 8.
    Chung J.-H., Han Y.K., Yang K.: New classes of optimal frequency-hopping sequences by interleaving techniques. IEEE Trans. Inf. Theory 55(12), 5783–5791 (2009).Google Scholar
  9. 9.
    Ding C., Yin J.: Sets of optimal frequency-hopping sequences. IEEE Trans. Inf. Theory 54(8), 3741–3745 (2008).Google Scholar
  10. 10.
    Ding C., Moisio M.J., Yuan J.: Algebraic constructions of optimal frequency-hopping sequences. IEEE Trans. Inf. Theory 53(7), 2606–2610 (2007).Google Scholar
  11. 11.
    Ding C., Fuji-Hara R., Fujiwara Y., Jimbo M., Mishima M.: Sets of frequency hopping sequences: bounds and optimal constructions. IEEE Trans. Inf. Theory 55(7), 3297–3304 (2009).Google Scholar
  12. 12.
    Ding C., Yang Y., Tang X.: Optimal sets of frequency hopping sequences from linear cyclic codes. IEEE Trans. Inf. Theory 56(7), 3605–3612 (2010).Google Scholar
  13. 13.
    Fuji-Hara R., Miao Y., Mishima M.: Optimal frequency hopping sequences: a combinatorial approach. IEEE Trans. Inf. Theory 50(10), 2408–2420 (2004).Google Scholar
  14. 14.
    Ge G., Miao Y., Yao Z.H.: Optimal frequency hopping sequences: auto- and cross-correlation properties. IEEE Trans. Inf. Theory 55(2), 867–879 (2009).Google Scholar
  15. 15.
    Han Y.K., Yang K.: On the Sidel’nikov sequences as frequency-hopping sequences. IEEE Trans. Inf. Theory 55(9), 4279–4285 (2009).Google Scholar
  16. 16.
    Han H., Peng D., Liu X.: New lower bounds on the aperiodic Hamming correlations of frequency hopping sequences with low hit zone. Des. Codes Cryptogr. 75(1), 157–174 (2015).Google Scholar
  17. 17.
    Lemos-Neto J.S., da Rocha Jr. V.C.: Cyclically permutable codes specified by roots of generator polynomial. Electron Lett. 50(17), 1202–1204 (2014).Google Scholar
  18. 18.
    Lempel A., Greenberger H.: Families of sequences with optimal Hamming correlation properties. IEEE Trans. Inf. Theory 20, 90–94 (1974).Google Scholar
  19. 19.
    Ling S., Xing C.: Coding Theory: A First Course. Cambridge University Press, Cambridge (2004).Google Scholar
  20. 20.
    Liu F., Peng D., Zhou Z., Tang T.: A new frequency-hopping sequence set based upon generalized cyclotomy. Des. Codes Cryptogr. 69(2), 247–259 (2013).Google Scholar
  21. 21.
    MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1997).Google Scholar
  22. 22.
    Peng D., Fan P.: Lower bounds on the Hamming auto- and cross correlations of frequency-hopping sequences. IEEE Trans. Inf. Theory 50(9), 2149–2154 (2004).Google Scholar
  23. 23.
    Ren W., Fu F., Zhou Z.: New sets of frequency-hopping sequences with optimal Hamming correlation. Des. Codes Cryptogr. 72(2), 423–434 (2014).Google Scholar
  24. 24.
    Song H.-Y., Reed I.S., Golomb S.W.: On the nonperiodic cyclic equivalence classes of Reed-Solomon codes. IEEE Trans. Inf. Theory 39(4), 1431–1434 (1993).Google Scholar
  25. 25.
    Yang Y., Tang X., Parampalli U., Peng D.: New bound on frequency hopping sequence sets and its optimal constructions. IEEE Trans. Inf. Theory 57(11), 7605–7613 (2011).Google Scholar
  26. 26.
    Yang Y., Tang X., Zhou Z.: Optimal frequency hopping sequence sets from MDS codes. Signal Design and Its Applications in Communications Workshop, Tokyo, Japan, pp. 162–165 (2013).Google Scholar
  27. 27.
    Zeng X., Cai H., Tang X., Yang Y.: A class of optimal frequency hopping sequences with new parameters. IEEE Trans. Inf. Theory 58(7), 4899–4907 (2012).Google Scholar
  28. 28.
    Zeng X., Cai H., Tang X., Yang Y.: Optimal frequency hopping sequences of odd length. IEEE Trans. Inf. Theory 59(5), 3237–3248 (2013).Google Scholar
  29. 29.
    Zhang A., Zhou Z., Feng K.: A lower bound on the average Hamming correlation of frequency-hopping sequence sets. Adv. Math. Commun. 9(1), 55–62 (2015).Google Scholar
  30. 30.
    Zhou Z., Tang X., Peng D., Parampalli U.: New constructions for optimal sets of frequency-hopping sequences. IEEE Trans. Inf. Theory 57(6), 3831–3840 (2011).Google Scholar
  31. 31.
    Zhou Z., Tang X., Niu X., Parampalli U.: New classes of frequency-hopping sequences with optimal partial correlation. IEEE Trans. Inf. Theory 58(1), 453–458 (2012).Google Scholar

Copyright information

© Springer Science+Business Media New York 2016

Authors and Affiliations

  • Bocong Chen
    • 1
    • 2
  • Liren Lin
    • 3
  • San Ling
    • 2
  • Hongwei Liu
    • 3
    Email author
  1. 1.School of MathematicsSouth China University of TechnologyGuangzhouChina
  2. 2.Division of Mathematical Sciences, School of Physical & Mathematical SciencesNanyang Technological UniversitySingaporeSingapore
  3. 3.School of Mathematics and StatisticsCentral China Normal UniversityWuhanChina

Personalised recommendations