Skip to main content

On the Aperiodic Hamming Correlation of Frequency-Hopping Sequences from Norm Functions

  • Conference paper

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

Abstract

Frequency-hopping sequences (FHSs) are needed in frequency hopping code-division multiple-access (FH-CDMA) systems. Aperiodic Hamming correlation of FHSs matters in real applications, while it received little attraction in the literature compared with periodic Hamming correlation. In this paper, we study the aperiodic Hamming correlation of a family of FHSs via norm functions by Ding, Moisio and Yuan (IEEE Trans Inform Theory 53: 2606-2610, 2007). Bounds on their aperiodic Hamming correlation are established based on the calculation and estimation of some exponential sums over finite fields.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beaulieu, N.C., Young, D.J.: Designing time-hopping ultrawidebandwidth receivers for multiuser interference environments. Proc. IEEE 97, 255–284 (2009)

    Article  Google Scholar 

  2. Carlet, C., Feng, K.: An Infinite Class of Balanced Functions with Optimal Algebraic Immunity, Good Immunity to Fast Algebraic Attacks and Good Nonlinearity. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol. 5350, pp. 425–440. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Chung, J.H., Han, Y.K., Yang, K.: New classes of optimal frequency-hopping sequences by interleaving techniques. IEEE Trans. Inf. Theory 45, 5783–5791 (2009)

    Article  MathSciNet  Google Scholar 

  4. Ding, C., Moisio, M.J., Yuan, J.: Algebraic constructions of optimal frequency-hopping sequences. IEEE Trans. Inf. Theory 53, 2606–2610 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Ding, C., Yin, J.: Sets of optimal frequency-hopping sequences. IEEE Trans. Inf. Theory 54, 3741–3745 (2008)

    Article  MathSciNet  Google Scholar 

  6. Ding, C., Fuji-Hara, R., Fujiwara, F., Jimbo, M., Mishima, M.: Sets of frequency hopping sequences: bounds and optimal constructions. IEEE Trans. Inf. Theory 55, 3297–3304 (2009)

    Article  MathSciNet  Google Scholar 

  7. Eun, Y.C., Jin, S.Y., Hong, Y.P., Song, H.Y.: Frequency hopping sequences with optimal partial autocorrelation properties. IEEE Trans. Inf. Theory 50, 2438–2442 (2004)

    Article  MathSciNet  Google Scholar 

  8. Ge, G., Miao, Y., Yao, Z.H.: Optimal frequency hopping sequences: auto- and cross-correlation properties. IEEE Trans. Inf. Theory 55, 867–879 (2009)

    Article  MathSciNet  Google Scholar 

  9. Helleseth, T., Kumar, P.V.: Sequences with low correlation. In: Pless, V., Huffman, C. (eds.) Handbook of Coding Theory, pp. 1767–1853. Elservier, Amsterdam (1998)

    Google Scholar 

  10. Lempel, A., Greenberger, A.: Families of sequence with optimal Hamming correlation properties. IEEE Trans. Inf. Theory 20, 90–94 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  11. Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press (1997)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Sarwate, D.V.: An upper bound on the aperiodic autocorrelation function for a maximal-length sequence. IEEE Trans. Inf. Theory IT-30, 685–687 (1984)

    Article  MathSciNet  Google Scholar 

  14. Simon, M.K., Omura, J.K., Scholtz, R.A.: Spread Spectrum Communications Handbook. McGraw-Hill, Inc. (2002)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  16. Zhou, Z.C., Tang, X.H., Peng, D.Y., Udaya, P.: New constructions for optimal sets of frequency-hopping sequences. IEEE Trans. Inf. Theory 57, 3831–3840 (2011)

    Article  MathSciNet  Google Scholar 

  17. Zhou, Z.C., Tang, X.H., Niu, X.H., Udaya, P.: New classes of frequency-hopping sequences with optimal partial correlation. IEEE Trans. on Inf. Theory 58, 453–458 (2012)

    Article  MathSciNet  Google Scholar 

  18. Zhou, Z.C., Tang, X.H., Yang, Y., Udaya, P.: A hybrid incomplete exponential sum with application to aperiodic Hamming correlation of some frequency-hopping sequences. Submitted to IEEE Trans. Inf. Theory

    Google Scholar 

  19. Wang, Q.: Optimal sets of frequency hopping sequences with large linear spans. IEEE Trans. Inf. Theory 56, 1729–1736 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhou, Z., Tang, X., Yang, Y., Parampalli, U. (2012). On the Aperiodic Hamming Correlation of Frequency-Hopping Sequences from Norm Functions. In: Helleseth, T., Jedwab, J. (eds) Sequences and Their Applications – SETA 2012. SETA 2012. Lecture Notes in Computer Science, vol 7280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30615-0_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-30615-0_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-30614-3

  • Online ISBN: 978-3-642-30615-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics