Skip to main content
SpringerLink
Log in

Improved Singleton Bound on Frequency Hopping Sequences

  • Conference paper
  • First Online:
Sequences and Their Applications - SETA 2014 (SETA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8865))

Included in the following conference series:

Abstract

In this paper, a new bound on the frequency hopping (FH) sequences with respect to the size of the frequency slot set, the sequence length, the family size, and the maximum periodic Hamming correlation is established. The new bound is tighter than the Singleton bounds on the FH sequences derived by Ding et al. (2009) and Yang et al. (2011) and the bound derived by Liu and Peng (2013).

This work was supported by National Science Foundation of China (Grant No. 61271244).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Specification of the Bluetooth Systems-Core. The Bluetooth Special Interest Group (SIG). http://www.bluetooth.com

  2. Fan, P.Z., Darnell, M.: Sequence Design for Communications Applications. Research Studies Press (RSP), John Wiley and Sons, London, UK (1996)

    Google Scholar 

  3. Golomb, S.W., Gong, G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography and Radar. Cambridge University Press, Cambridge (2005)

    Book  Google Scholar 

  4. Lempel, A., Greenberger, H.: Families of sequences with optimal Hamming correlation properties. IEEE Trans. Inf. Theor. 20(1), 90–94 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  5. Ding, C., Fuji-Hara, R., Fujiwara, Y., Jimbo, M., Mishima, M.: Sets of frequency hopping sequences: Bounds and optimal constructions. IEEE Trans. Inf. Theor. 55(7), 3297–3304 (2009)

    Article  MathSciNet  Google Scholar 

  6. Ding, C., Yang, Y., Tang, X.H.: Optimal sets of frequency hopping sequences from linear cyclic codes. IEEE Trans. Inf. Theor. 55(7), 3605–3612 (2010)

    Article  MathSciNet  Google Scholar 

  7. Chu, W., Colbourn, C.J.: Optimal frequency-hopping sequences via cyclotomy. IEEE Trans. Inf. Theor. 51(3), 1139–1141 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Yang, Y., Tang, X.H., Udaya, P., Peng, D.Y.: New bound on frequency hopping sequence sets and its optimal constructions. IEEE Trans. Inf. Theor. 57(11), 7605–7613 (2011)

    Article  MathSciNet  Google Scholar 

  9. Ge, G., Miao, Y., Yao, Z.: Optimal frequency hopping sequences: Auto- and cross-correlation properties. IEEE Trans. Inf. Theor. 55(2), 867–879 (2009)

    Article  MathSciNet  Google Scholar 

  10. Udaya, P., Siddiqi, M.U.: Optimal large linear span frequency hopping patterns derived from polynomial residue class rings. IEEE Trans. Inf. Theor. 44(4), 1492–1503 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  11. Chung, J.H., Yang, K.: Optimal frequency-hopping sequences with new parameters. IEEE Trans. Inf. Theor. 56(4), 1685–1693 (2010)

    Article  MathSciNet  Google Scholar 

  12. Peng, D.Y., Fan, P.Z., Lee, M.H.: Lower bounds on the periodic Hamming correlations of frequency hopping sequences with low hit zone. Sci. China Ser. F. Inf. Sci. 49(2), 208–218 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  13. Peng, D.Y., Fan, P.Z.: Lower bounds on the Hamming auto- and cross-correlations of frequency- hopping sequences. IEEE Trans. Inf. Theor. 50(9), 2149–2154 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  14. Lin, S., Xing, C.: Coding Theory: A First Course. Cambridge University Press, Cambridge (2004)

    Google Scholar 

  15. Liu, X., Peng, D.Y.: Theoretical bound on frequency hopping sequence set. Electron. Lett. 49(10), 654–656 (2013)

    Article  Google Scholar 

  16. Golomb, S.W.: A mathematical theory of discrete classification. In: Proceedings of 4th London Symposium Information Theory, pp. 404–425. Butterworths, London (1961)

    Google Scholar 

  17. Golomb, S.W., Gordon, B., Welch, L.R.: Comma-free codes. Can. J. Math. 10, 202–209 (1958)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Provincial Key Lab of Information Coding and Transmission, Institute of Mobile Communications, Southwest Jiaotong University, Chengdu, China

    Xing Liu, Daiyuan Peng & Hongyu Han

Authors
  1. Xing Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daiyuan Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hongyu Han
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xing Liu .

Editor information

Editors and Affiliations

  1. Otto-von-Guericke University, Magdeburg, Germany

    Kai-Uwe Schmidt

  2. Austrian Academy of Sciences, Linz, Austria

    Arne Winterhof

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, X., Peng, D., Han, H. (2014). Improved Singleton Bound on Frequency Hopping Sequences. In: Schmidt, KU., Winterhof, A. (eds) Sequences and Their Applications - SETA 2014. SETA 2014. Lecture Notes in Computer Science(), vol 8865. Springer, Cham. https://doi.org/10.1007/978-3-319-12325-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12325-7_26

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12324-0

  • Online ISBN: 978-3-319-12325-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation