Skip to main content
SpringerLink
Log in

Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

A construction of a family of generalized polyphase cyclotomic sequences of length pq is presented in terms of the generalized cyclotomic classes modulo pq. Their linear complexity and corresponding minimal polynomials are deduced. Some upper bounds on periodic and aperiodic autocorrelation values of resulting sequences are also estimated by using certain exponential sums.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

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

References

  1. Brandstätter N, Winterhof A. Some notes on the two-prime generator of order 2. IEEE Transactions on Information Theory, 2005, 51(10): 3654–3657

    Article  Google Scholar 

  2. Cusick T W, Ding C, Renvall A. Stream Ciphers and Number Theory. Elsevier, Amsterdam, 1998

    MATH  Google Scholar 

  3. Ding C. Binary cyclotomic generators. Fast Software Encrytion, Berlin: Springer-Verlag, LNCS, 1995, 1008: 20–60

    Google Scholar 

  4. Ding C. Linear complexity of generalized cyclotomic binary sequence of order 2. Finite Fields and Their Applications, 1997, 3(2): 159–174

    Article  MATH  MathSciNet  Google Scholar 

  5. Ding C. Autocorrelation values of generalized cyclotomic sequences of order two. IEEE Transactions on Information Theory, 1998, 44(4): 1699–1702

    Article  MATH  Google Scholar 

  6. Green D H, Green P R. Modified Jacobi sequences. IEE Proceedings. Computers and Digital Techniques, 2000, 147(4): 241–251

    Article  Google Scholar 

  7. Green D H, Choi J. Linear complexity of modified Jacobi sequences. IEE Proceedings. Computers and Digital Techniques, 2002, 149(3): 97–101

    Article  Google Scholar 

  8. Bai E, Liu X, Xiao G. Linear complexity of new generalized cyclotomic sequences of order two of length pq. IEEE Transactions on Information Theory, 2005, 51(5): 1849–1853

    Article  MathSciNet  Google Scholar 

  9. Chen Z, Du X, Xiao G. Sequences related to Legendre/Jacobi sequences. Information Sciences, 2007, 177(21): 4820–4831

    Article  MATH  MathSciNet  Google Scholar 

  10. Chen Z, Li S. Some notes on generalized cyclotomic sequences of length pq. Journal of Computer Science and Technology, 2008, 23(5): 843–850

    Article  MathSciNet  Google Scholar 

  11. Du X, Yan T, Xiao G. Trace representation of some generalized cyclotomic sequences of length pq. Information Sciences, 2008, 178(16): 3307–3316

    Article  MATH  MathSciNet  Google Scholar 

  12. Li S, Chen Z, Fu X, Xiao G. Autocorrelation values of new generalized cyclotomic sequences of order two and length pq. Journal of Computer Science and Technology, 2007, 22(6): 830–834

    Article  MathSciNet  Google Scholar 

  13. Yan T, Du X, Xiao G, Huang X. Linear complexity of binary Whiteman generalized cyclotomic sequences of order 2k. Information Sciences, 2009, 179(7): 1019–1023

    Article  MATH  MathSciNet  Google Scholar 

  14. Yan T, Hong L, Xiao G. The linear complexity of new generalized cyclotomic binary sequences of order four. Information Sciences, 2008, 178(3): 807–815

    Article  MATH  MathSciNet  Google Scholar 

  15. Zhang H Y. Research on Legendre and Jacobi Sequences. Dissertation of Shanghai Jiao Tong University, 2008 (in Chinese)

  16. Zhou X, Li C. Auto-correlation function of generalized Jacobi sequences. Journal of Electronics & Information Technology, 2005, 27(4): 625–628 (in Chinese)

    Google Scholar 

  17. Meidl W. Remarks on a cyclotomic sequence. Designs, Codes and Cryptography, 2009, 51(1): 33–43

    Article  MathSciNet  Google Scholar 

  18. Lidl R, Niederreiter H. Finite Fields. Reading: Addison-Wesley, MA, 1983

    MATH  Google Scholar 

  19. Rivat J, Sárközy A. Modular constructions of pseudorandom binary sequences with composite moduli. Periodica Mathematica Hungarica, 2005, 51(2): 75–107

    Article  MATH  MathSciNet  Google Scholar 

  20. Green D H, Green P R. Polyphase related-prime sequences. IEE Proceedings. Computers and Digital Techniques, 2001, 148(2): 53–62

    Article  Google Scholar 

  21. Hu Y, Wei S, Xiao G. On the linear complexity of generalised Legendre/Jacobi sequences. Acta Electronica Sinica, 20002, 8(2): 113–117 (in Chinese)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Applied Mathematics, Putian University, Putian, 351100, China

    Zhixiong Chen

  2. State Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, Beijing, 100039, China

    Zhixiong Chen & Xiaoni Du

  3. College of Mathematics and Information Science, Northwest Normal University, Lanzhou, 730070, China

    Xiaoni Du

Authors
  1. Zhixiong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaoni Du
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhixiong Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, Z., Du, X. Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq . Front. Comput. Sci. China 4, 529–535 (2010). https://doi.org/10.1007/s11704-010-0329-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-010-0329-3

Keywords

Search

Navigation