Skip to main content
SpringerLink
Log in

Pseudo-Randomness of Certain Sequences of k Symbols with Length pq

  • Short Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

The theory of finite pseudo-random binary sequences was built by C. Mauduit and A. Sárközy and later extended to sequences of k symbols (or k-ary sequences). Certain constructions of pseudo-random sequences of k symbols were presented over finite fields in the literature. In this paper, two families of sequences of k symbols are constructed by using the integers modulo pq for distinct odd primes p and q. The upper bounds on the well-distribution measure and the correlation measure of the families sequences are presented in terms of certain character sums over modulo pq residue class rings. And low bounds on the linear complexity profile are also estimated.

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. Mauduit C, Sárközy A. On finite pseudo-random binary sequences I: Measures of pseudo-randomness, the Legendre symbol. Acta Arithmetica, 1997, 82: 365–377.

    MathSciNet  MATH  Google Scholar 

  2. Cassaigne J, Mauduit C, Sárközy A. On finite pseudo-random binary sequences, VII: The measures of pseudo-randomness. Acta Arithmetica, 2002, 103(2): 97–118.

    Article  MathSciNet  MATH  Google Scholar 

  3. Mauduit C, Sarközy A. On finite pseudo-random sequences of k symbols. Indagationes Mathematicae-New Series, 2002, 13(1): 89–101.

    Article  MathSciNet  MATH  Google Scholar 

  4. Ahlswede R, Mauduit C, Sárközy A. Large Families of Pseudorandom Sequences of k Symbols and Their Complexity, Part I. General Theory of Information Transfer and Combinatorics, LNCS 4123, Springer-Verlag, 2006, pp.293-307.

  5. Ahlswede R, Mauduit C, Sárközy A. Large Families of Pseudorandom Sequences of k Symbols and Their Complexity, Part II. General Theory of Information Transfer and Combinatorics, LNCS 4123, Springer-Verlag, 2006, pp.308-325.

  6. Bérczi G. On finite pseudo-random sequences of k symbols. Periodica Mathematica Hungarica, 2003, 47(1/2): 29–44.

    Article  MathSciNet  MATH  Google Scholar 

  7. Mérai L. On finite pseudo-random lattices of k symbols. Monatshefte für Mathematik, 2010, 161(2): 173–191.

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

  11. 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 

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

    Article  MathSciNet  MATH  Google Scholar 

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

  14. Du X, Chen Z. Trace representations of generalized cyclotomic sequences of length pq with arbitrary order. Chinese Journal of Electronics, 2009, 18(3): 460–464. (In Chinese)

    Google Scholar 

  15. 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  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

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

    Google Scholar 

  18. Winterhof A. Linear Complexity and Related Complexity Measures. Selected Topics in Information and Coding Theory, Singapore: World Scientific, 2010, pp.3-40.

    Google Scholar 

  19. Lidl R, Niederreiter H. Finite Fields. Cambridge: Cambridge Univ. Press, 1997.

    Google Scholar 

  20. Niederreiter H. Linear complexity and related complexity measures for sequences. In Proc. INDOCRYPT 2003, New Delhi, India, Dec. 8–10, 2003, pp.1-17.

  21. Chen Z, Winterhof A. Linear complexity profile of m-ary pseudo-random sequences with small correlation measure. Indagationes Mathematicae-New Series, 2010. (To appear)

  22. Chen Z, Du X. Linear complexity and autocorrelation values of a polyphase generalized cyclotomic sequence of length pq. Frontiers of Computer Science in China, 2010, 4(4): 529–535.

    Article  Google Scholar 

  23. Ding C. New generalized cyclotomy and its applications. Finite Fields and Their Applications, 1998, 4(2): 140–166.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Putian University, Putian, 351100, China

    Zhi-Xiong Chen (Member, CCF) & Chen-Huang Wu (Member, CCF)

  2. State Key Lab. of ISN, Xidian University, Xi’an, 710071, China

    Zhi-Xiong Chen (Member, CCF) & Xiao-Ni Du

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

    Xiao-Ni Du

Authors
  1. Zhi-Xiong Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiao-Ni Du
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Chen-Huang Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiao-Ni Du.

Additional information

The work was partially supported by the National Natural Science Foundation of China under Grant No. 61063041, the Program for New Century Excellent Talents of Universities in Fujian Province under Grant No. JK2010047 and the Funds of the Education Department of Gansu Province under Grant No. 1001–09.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

(PDF 78 kb)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, ZX., Du, XN. & Wu, CH. Pseudo-Randomness of Certain Sequences of k Symbols with Length pq . J. Comput. Sci. Technol. 26, 276–282 (2011). https://doi.org/10.1007/s11390-011-9434-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-011-9434-5

Keywords

Search

Navigation