Skip to main content

The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings

  • Conference paper
Sequences and Their Applications - SETA 2008 (SETA 2008)

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

Included in the following conference series:

  • 933 Accesses

Abstract

Weighted degree trace codes over even characteristic Galois rings give binary sequences by projection on their most significant bit (MSB). Upper bounds on the aperiodic correlation, peak to sidelobe level (PSL), partial period imbalance and partial period pattern imbalance of these sequences are derived. The proof technique involves estimates of incomplete character sums over Galois rings, combining Weil-like bounds with Fourier transform estimates.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dai, Z.D.: Binary sequences derived from ML-sequences over rings I: period and minimal polynomial. J. Cryptology 5, 193–507 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  2. Dmitriev, D., Jedwab, J.: Bounds on the growth rate of the peak sidelobe level of binary sequences. Advances in Mathematics of Communications 1, 461–475 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  3. Jedwab, J.: A survey of the merit factor problem for binary sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol. 3486, pp. 30–55. Springer, Heidelberg (2005)

    Google Scholar 

  4. Koponen, S., Lahtonen, J.: On the aperiodic and odd correlations of the binary Shanbhag-Kumar-Helleseth sequences. IEEE Trans. Inform. Theory IT-43, 1593–1596 (1997)

    Article  MathSciNet  Google Scholar 

  5. Lahtonen, J., Ling, S., Solé, P., Zinoviev, D.: Z 8-Kerdock codes and pseudo-random binary sequences. Journal of Complexity 20(2-3), 318–330 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Schmidt, K.U.: PhD thesis, On spectrally bounded codes for multicarrier communications. Vogt Verlag, Dresden, Germany (2007), http://www.ifn.et.tu-dresden.de/~schmidtk/#publications

  7. Solé, P., Zinoviev, D.: The most significant bit of maximum length sequences over \({Z}_{2^l}\): autocorrelation and imbalance. IEEE Transactions on Information Theory IT-50, 1844–1846 (2004)

    Article  Google Scholar 

  8. Solé, P., Zinoviev, D.: Low correlation, high nonlinearity sequences for multi-code CDMA. IEEE Transactions on Information Theory IT-52, 5158–5163 (2006)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Hu, H., Feng, D., Wu, W.: Incomplete exponential sums over Galois rings with applications to some binary sequences derived from \({\mathbb Z}_{2}\iota\). IEEE Trans. Inform. Theory, IT-52, 2260–2265 (2006)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Solomon W. Golomb Matthew G. Parker Alexander Pott Arne Winterhof

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Solé, P., Zinoviev, D. (2008). The Peak to Sidelobe Level of the Most Significant Bit of Trace Codes over Galois Rings. In: Golomb, S.W., Parker, M.G., Pott, A., Winterhof, A. (eds) Sequences and Their Applications - SETA 2008. SETA 2008. Lecture Notes in Computer Science, vol 5203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85912-3_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85912-3_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85911-6

  • Online ISBN: 978-3-540-85912-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics