Abstract
In this paper, binary sequences based on the generalized cyclotomy are studied. We define two generalized cyclotomic sequences of length 2p m, one sequence (called the classical one) is defined using the classical method, the other one (called the modified one) is defined in a slightly modified manner. The linear complexity of the two proposed sequences of length 2p m is determined with two different approaches. The results show that the two proposed sequences have high linear complexity.
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. Inform. Theory 51, 1849–1853 (2005)
Burton D.M.: Elementary Number Theory. McGram-Hill, New York (1998)
Ding C.: Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields their Appl. 3, 159–174 (1997)
Ding C.: Linear complexity of some generalized cyclotomic sequences. Int. J. Algebra Comput. 8, 431–442 (1998)
Ding C.: Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Trans. Inform. Theory 44, 1699–1702 (1998)
Ding C., Hellseth T., Shan W.: On the linear complexity of Legendre sequences. IEEE Trans. Inform. Theory 44, 1276–1278 (1998)
Ding C., Helleseth T.: New generalized cyclotomy and its applications. Finite Fields their Appl. 4, 140–166 (1998)
Ding C., Helleseth T.: Generalized cyclotomic codes of length \({p_1^{e_1} \cdots p_t^{e_t}}\) . IEEE Trans. Inform. Theory 45, 467–474 (1999)
Ding C., Pless V.: Cyclotomy and duadic codes of prime lengths. IEEE Trans. Inform. Theory 45, 453–466 (1999)
Golomb S.W.: Shift Register Sequences. Holden-Day, San Francisco, CA (1967)
Golomb S.W., Gong G.: Signal Design for Good Correlation for Wireless Communication. Cryptography and Radar. Cambridge University Press, Cambridge (2005)
Kim, Y.-J., Jin, S.-Y., Song, H.-Y.: Linear complexity and autocorrelation of prime cube sequences. In: Serdar Boztas, Hsiao-Feng (Francis) Lu (eds.) AAECC-17, LNCS 4851, 188–197 (2007)
Kim, Y.-J., Song, H.-Y.: Linear complexity of prime n-square sequences. In: Proceedings IEEE International Sympopsium on Information Theory 2008, 2405–2408 (2008)
Lidl R., Neiderreiter H.: Finite Fields. Encyclopedia of Mathematics and its Applications Reading Vol. 20. Addison-Wesley, MA (1983)
Menezes A., Oorschot P.V., Vanstone S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Nathanson, M.B.: Elementary Methods in Number Theoty. Springer, Berlin, GTM 195 (2003)
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)
Yan T., Sun R., Xiao G.: Autocorrelation and linear complexity of the new generalized cyclotomic sequences. IEICE Trans. Fundamentals E90-A 4, 857–864 (2007)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work is supported by NSFC (No. U0635003), NSFC (No. 60572059) and Scientific Research Starting Foundation for Doctors of Guangdong Province (Grant No. 9451009101003191).
Rights and permissions
About this article
Cite this article
Zhang, J., Zhao, CA. & Ma, X. Linear complexity of generalized cyclotomic binary sequences of length 2p m . AAECC 21, 93–108 (2010). https://doi.org/10.1007/s00200-009-0116-2
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00200-009-0116-2