Skip to main content
Springer Nature Link
Log in

Linear complexity of generalized cyclotomic binary sequences of length 2p m

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

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.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. 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)

    Article  MathSciNet  Google Scholar 

  2. Burton D.M.: Elementary Number Theory. McGram-Hill, New York (1998)

    MATH  Google Scholar 

  3. Ding C.: Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Fields their Appl. 3, 159–174 (1997)

    Article  MATH  Google Scholar 

  4. Ding C.: Linear complexity of some generalized cyclotomic sequences. Int. J. Algebra Comput. 8, 431–442 (1998)

    Article  MATH  Google Scholar 

  5. Ding C.: Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Trans. Inform. Theory 44, 1699–1702 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ding C., Hellseth T., Shan W.: On the linear complexity of Legendre sequences. IEEE Trans. Inform. Theory 44, 1276–1278 (1998)

    Article  MathSciNet  Google Scholar 

  7. Ding C., Helleseth T.: New generalized cyclotomy and its applications. Finite Fields their Appl. 4, 140–166 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  8. 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)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ding C., Pless V.: Cyclotomy and duadic codes of prime lengths. IEEE Trans. Inform. Theory 45, 453–466 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  10. Golomb S.W.: Shift Register Sequences. Holden-Day, San Francisco, CA (1967)

    MATH  Google Scholar 

  11. Golomb S.W., Gong G.: Signal Design for Good Correlation for Wireless Communication. Cryptography and Radar. Cambridge University Press, Cambridge (2005)

    MATH  Google Scholar 

  12. 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)

  13. 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)

  14. Lidl R., Neiderreiter H.: Finite Fields. Encyclopedia of Mathematics and its Applications Reading Vol. 20. Addison-Wesley, MA (1983)

    Google Scholar 

  15. Menezes A., Oorschot P.V., Vanstone S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)

    MATH  Google Scholar 

  16. Nathanson, M.B.: Elementary Methods in Number Theoty. Springer, Berlin, GTM 195 (2003)

  17. 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)

    Article  MATH  MathSciNet  Google Scholar 

  18. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Sun Yat-sen University, 510275, Guangzhou, China

    Jingwei Zhang & Xiao Ma

  2. School of Computer Science and Educational Software, Guangzhou University, 510006, Guangzhou, China

    Chang-An Zhao

Authors
  1. Jingwei Zhang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Chang-An Zhao
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Xiao Ma
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Jingwei Zhang.

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

Reprints 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

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-009-0116-2

Keywords

Mathematics Subject Classification (2000)