Abstract
This paper presents some nonrandom distribution properties of two generalized cyclotomic binary sequences of length \(2p^{m}\) constructed by Zhang et al. (Appl Algebra Eng Commun Comput 21:93–108, 2010). Using these properties we further study the \(k\)-error linear complexity and autocorrelation of these sequences. For some small values of \(k\), the upper bounds on the \(k\)-error linear complexity are derived, which are far less than their linear complexity. Finally the bounds on the autocorrelation of these sequences are also presented. Our results show that there exist some drawbacks in application of these two sequences.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bai, E., Liu, X., Xiao, G.: Linear complexity of new generalized cyclotomic squences of order two of length \(pq\). IEEE Trans. Inf. Theory 51(5), 1849–1853 (2005)
Cesmelioglu, A., Meidl, W.: A general approach to construction and determination of the linear complexity of sequences based on cosets. In: Sequences and Their Applications. Lecture Notes in Computer Science, vol. 6338, pp. 125–138. Springer-Verlag, Berlin (2010)
Dai, Z., Yang, J., Gong, G., Wang, P.: On the linear complexity of generalized Legendre sequences. In: Sequences and Their Applications (2001), Discrete Mathematics and Theoretical Computer Science (London). pp. 145–153. Springer, London (2002)
Ding, C., Hellseth, T., Shan, W.: On the linear complexity of Legendre sequences. IEEE Trans. Inf. Theory 44(3), 1276–1278 (1998)
Ding, C., Hellseth, T.: New generalized cyclotomy and its applications. Finite Fields Appl. 4, 140–166 (1998)
Ding, C.: Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields Appl. 3, 159–174 (1997)
Ding, C.: Autocorrelation values of generalized cyclotomic sequences of order 2. IEEE Trans. Inf. Theory 44(4), 1699–1702 (1998)
Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. Lecture Notes in Computer Science, vol. 561, Springer, Berlin (1991)
Kim, Y.J., Jin, S.Y., Song, H.Y.: Linear complexity and autocorrelation of prime cube sequences. In: Boztas S., Lu H.-F. (eds.) LNCS 4851. vol. 17, pp. 188–197, Applicable Algebra in Engineering, Communication and Computing (2007)
Meidl, W.: Remarks on a cyclotomic sequence. Des. Codes Cryptogr. 51, 33–43 (2009)
Nathanson, M.B.: Elementary Methods in Number Theory. Springer, Berlin, GTM 195 (2003)
Stamp, M., Martin, C.F.: An algorithm for the \(k\)-error linear complexity of binary sequences with period \(2^{n}\). IEEE Trans. Inf. Theory 39(4), 1398–1401 (1993)
Yan, T., Sun, R., Xiao, G.: Autocorrelation and linear complexity of the new generalized cyclotomic sequences. IEICE Trans. Fundam. E90-A 4, 857–864 (2007)
Yan, T., Li, S., Xiao, G.: On the linear complexity of generalized cyclotomic sequences with the period \(p^{m}\). Appl. Math. Lett. 21, 187–193 (2008)
Zhang, J., Zhao, C., Ma, X.: Linear complexity of generalized cyclotomic sequences with length \(2p^{m}\). Appl. Algebra Eng. Commun. Comput. 21, 93–108 (2010)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was supported by the NSF of China under Grant Numbers 61070178, 61272042 and 61100200.
Rights and permissions
About this article
Cite this article
Tan, L., Xu, H. & Qi, WF. Remarks on the generalized cyclotomic sequences of length \(2p^{m}\) . AAECC 23, 221–232 (2012). https://doi.org/10.1007/s00200-012-0177-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-012-0177-5