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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dai, Z.D.: Binary sequences derived from ML-sequences over rings I: period and minimal polynomial. J. Cryptology 5, 193–507 (1992)
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)
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)
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)
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)
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
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)
Solé, P., Zinoviev, D.: Low correlation, high nonlinearity sequences for multi-code CDMA. IEEE Transactions on Information Theory IT-52, 5158–5163 (2006)
Sarwate, D.V.: Upper bound on the aperiodic autocorrelation function for a maximal-length sequence. IEEE Trans. Inform. Theory IT-30, 685–687 (1984)
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)
Author information
Authors and Affiliations
Editor information
Rights 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)