Abstract
Let p be an odd prime and m be a positive integer. In this paper, we prove that the one-error linear complexity over F p of Sidelnikov sequences of length p m – 1 is \((\frac{p+1}{2})^{m} -1\), which is much less than its (zero-error) linear complexity.
This work was supported by Korea Research Foundation Grant (KRF-2003-041-D00417).
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Sidelnikov, V.M.: Some k-valued pseudo-random and nearly equidistant codes. Probl. Pered. Inform. 5(1), 16–22 (1969)
Lempel, A., Cohn, M., Eastman, W.L.: A class of balanced binary sequences with optimal autocorrelation properties. IEEE Trans. Inform. Theory 23(1), 38–42 (1977)
Sarwate, D.V.: Comments on A Class of Balanced Binary Sequences with Optimal Autocorrelation Properties. IEEE Trans. Inform. Theory 24(1), 128–129 (1978)
No, J.-S., Chung, H., Song, H.-Y., Yang, K., Lee, J.-D., Helleseth, T.: New Construction for Binary Sequences of period p m − 1 with Optimal Autocorrelation Using (z + 1)d + az d + b. IEEE Trans. Inform. Theory 47(4), 1638–1644 (2001)
Helleseth, T., Yang, K.: On binary sequences of period p m − 1 with optimal autocorrelation. In: Proc. 2001 Conf. Sequences and Their Applications (SETA 2001), Bergen, Norway, May 13-17, pp. 29–30 (2001)
Kyureghyan, G.M., Pott, A.: On the linear complexity of the Sidelnikov-Lempel-Cohn-Eastman sequences. Design, Codes and Cryptography 29, 149–164 (2003)
Helleseth, T., Kim, S.-H., No, J.-S.: Linear complexity over F p and trace representation of Lempel-Cohn-Eastman sequences. IEEE Trans. Inform. Theory 49(6), 1522–1548 (2003)
Helleseth, T., Maas, M., Mathiassen, J.E., Segers, T.: Linear complexity over F p of Sidelnikov sequences. IEEE Trans. Inform. Theory 50(10), 2468–2472 (2004)
Stamp, M., Martin, C.F.: An algorithm for the k-linear complexity of binary sequences with period 2n. IEEE Trans. Inform. Theory 39(4), 1398–1401 (1993)
Cusick, T.W., Ding, C., Renvall, A.: Stream Ciphers and Number Theory. North-Holland Mathematical Library 55. North-Holland/Elsevier, Amsterdam (1998)
Blahut, R.E.: Transform techniques for error control codes. IBM J. Res. Develop. 23, 299–315 (1979)
Blahut, R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, New York (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eun, YC., Song, HY., Kyureghyan, G.M. (2005). One-Error Linear Complexity over F p of Sidelnikov Sequences. In: Helleseth, T., Sarwate, D., Song, HY., Yang, K. (eds) Sequences and Their Applications - SETA 2004. SETA 2004. Lecture Notes in Computer Science, vol 3486. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11423461_9
Download citation
DOI: https://doi.org/10.1007/11423461_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26084-4
Online ISBN: 978-3-540-32048-7
eBook Packages: Computer ScienceComputer Science (R0)