Skip to main content
SpringerLink
Log in

Some Notes on Prime-Square Sequences

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

Abstract

The well-known binary Legendre sequences possess good autocorrelation functions and high linear complexity, and are just special cases of much larger families of cyclotomic sequences. Prime-square sequences are the generalization of these Legendre sequences, but the ratio of the linear complexity to the least period of these sequences approximates to zero if the prime is infinite. However, a relatively straightforward modification can radically improve this situation. The structure and properties, including linear complexity, minimal polynomial, and autocorrelation function, of these modified prime-square sequences are investigated. The hardware implementation is also considered.

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. Massey J L. Shift register synthesis and BCH decoding. IEEE Trans. Inform. Theory, 1969, 15(1): 122–127.

    Article  MATH  MathSciNet  Google Scholar 

  2. Calabro D, Wolf J K. On the synthesis of two-dimensional arrays with desirable correlation properties. Inf. Control, 1967, 11(5/6): 537–560.

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  4. Ding C. Linear complexity of some generalized cyclotomic sequences. International Journal on Algebra and Computation, 1998, 8(4): 431–442.

    Article  MATH  Google Scholar 

  5. Park Y H, Hong D, Chun E. On the linear complexity of some generalized cyclotomic sequences. International Journal on Algebra and Computation, 2004, 14(4): 431–439.

    Article  MATH  Google Scholar 

  6. Ding C. Binary cyclotomic generator. Fast Software Encryption, Lecture Notes in Comput. Sci. 1008, Springer, Berlin, 1995, pp.29–60.

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Storer T. Cyclotomy and Difference Sets. Chicago: Markham, 1967.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Technology, Donghua University, Shanghai, 201620, China

    En-Jian Bai

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

    En-Jian Bai

  3. Department of Information and Computing Science, Shanghai University of Electric Power, Shanghai, 200090, China

    Xiao-Juan Liu

Authors
  1. En-Jian Bai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiao-Juan Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to En-Jian Bai.

Additional information

This work is supported by the National Natural Science Foundation of China under Grant No. 60503009.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bai, EJ., Liu, XJ. Some Notes on Prime-Square Sequences. J Comput Sci Technol 22, 481–486 (2007). https://doi.org/10.1007/s11390-007-9042-6

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-007-9042-6

Keywords

Search

Navigation