Multiplexing Realizations of the Decimation-Hadamard Transform of Two-Level Autocorrelation Sequences | SpringerLink
Skip to main content

Multiplexing Realizations of the Decimation-Hadamard Transform of Two-Level Autocorrelation Sequences

  • Conference paper
Coding and Cryptology (IWCC 2009)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 5557))

Included in the following conference series:

  • 734 Accesses

Abstract

In an effort to search for new binary two-level autocorrelation sequences of period 2n − 1, a new method of iterative decimation-Hadamard transform is proposed. It is based on the Hadamard transform of a shift and decimation of a binary two-level autocorrelation sequence, and its multiplexing. The experimental results show that several known binary two-level autocorrelation sequences can be obtained from our method.

This work was supported by NSERC Grant RGPIN 227700-00.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Gong, G., Golomb, S.W.: The decimation-Hadamard transform of two-level autocorrelation sequences. IEEE Trans. Inform. Theory 48(4), 853–865 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dillon, J.F., Dobbertin, H.: New cyclic difference sets with Singer parameters. Finite Fields and Their Applications 10, 342–389 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  3. Hertel, D.: Extended Hadamard Equivalence. In: Gong, G., Helleseth, T., Song, H.-Y., Yang, K. (eds.) SETA 2006. LNCS, vol. 4086, pp. 119–128. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  4. No, J.S., Golomb, S.W., Gong, G., Lee, H.K., Gaal, P.: Binary pseudorandom sequences of period 2m − 1 with ideal autocorrelation. IEEE Trans. Inform. Theory 44(2), 814–817 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  5. Charpin, P., Gong, G.: Hyperbent functions, Kloosterman sums, and Dickson polynomials. IEEE Trans. Inform. Theory 54(9), 4230–4238 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  7. Yu, N., Gong, G.: Realization of decimation-Hadamard transform for binary generalized GMW sequences. In: Proc. of Workshop on Coding and Cryptography (WCC), Bergen, Norway, pp. 127–136 (March 2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, N.Y., Gong, G. (2009). Multiplexing Realizations of the Decimation-Hadamard Transform of Two-Level Autocorrelation Sequences. In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds) Coding and Cryptology. IWCC 2009. Lecture Notes in Computer Science, vol 5557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01877-0_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01877-0_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01813-8

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics