Skip to main content
Springer Nature Link
Log in

Families of p-ary sequences with low correlation and large linear complexity

  • Published:
Journal of Systems Science and Complexity Aims and scope Submit manuscript

Abstract

This paper generalizes a method of generating shift sequences in the interleaved construction proposed by Gong. With the new shift sequences, some new families of p-ary sequences with desired properties can be obtained. A lower bound on the number of new families of binary sequences is also established.

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

References

  1. Golomb S W and Gong G, Signal Design for Good Correlation for Wireless Communication, Cryptography, and Radar, Cambridge University Press, New York, 2005.

    Book  MATH  Google Scholar 

  2. Helleseth T and Kumar P V, Sequences with low correlation, in Handbook of Coding Theory (eds. by Pless V and Huffman C), Elsevier, Amsterdam, 1998.

    Google Scholar 

  3. Boztas S and Kumar P V, Binary sequences with Gold-like correlation but larger linear span, IEEE Trans. Inf. Theory, 1994, 40(3): 532–537.

    Article  MATH  Google Scholar 

  4. Gold R, Maximal recursive sequences with 3-valued cross-correlation functions, IEEE Trans. Inf. Theory, 1968, 14(1): 154–156.

    Article  MATH  Google Scholar 

  5. Kasami T, Weight distribution of Bose-Chaudhuri-Hocquenghem codes, in Combinatorial Mathematics and Its Applications (eds. by Bose R C and Dowling T A), Univ. North Carolina Press, Chapel Hill, 1969.

    Google Scholar 

  6. Sarwate D V and Pursley M B, Crosscorrelation properties of pseudorandom and related sequences, Proc. IEEE, 1980, 68(3): 593–619.

    Article  Google Scholar 

  7. Zeng X, Liu J Q, and Hu L, Generalized Kasami sequences: The large set, IEEE Trans. Inf. Theory, 2007, 53(7): 2587–2598.

    Article  MATH  MathSciNet  Google Scholar 

  8. Welch L R, Lower bounds on the maximum cross correlation of signals, IEEE Trans. Inf. Theory, 1974, 20(3): 397–399.

    Article  MATH  MathSciNet  Google Scholar 

  9. Olsen J D, Scholtz R A, and Welch L R, Bent-function sequences, IEEE Trans. Inf. Theory, 1982, 28(11): 858–864.

    Article  MATH  MathSciNet  Google Scholar 

  10. Gong G, New designs for signal sets with low cross correlation, balance property, and large linear span: GF(p) case, IEEE Trans. Inf. Theory, 2002, 48(11): 2847–2867.

    Article  MATH  Google Scholar 

  11. Tang X H and Ding C, New classes of balanced quaternary and almost balanced binary sequences with optimal autocorrelation, IEEE Trans. Inf. Theory, 2010, 56(12): 6398–6405.

    Article  MathSciNet  Google Scholar 

  12. Tang X H and Gong G, New constructions of binary sequences with optimal autocorrelation value/magnitude, IEEE Trans. Inf. Theory, 2010, 56(3): 1278–1286.

    Article  MathSciNet  Google Scholar 

  13. Zeng X, Hu L, and Liu Q, A novel method for constructing almost perfect polyphase sequences, Proceedings of the International Workshop on Coding and Cryptography (ed. by Ytrehus Ø), Lecture Notes in Computer Science 3969, Bergen, 2006.

    Google Scholar 

  14. Gong G, Theory and applications of q-ary interleaved sequences, IEEE Trans. Inf. Theory, 1995, 41(3): 400–411.

    Article  MATH  Google Scholar 

  15. Berlekamp E R, Algehmic Coding Theory, McGraw-Hill, New York, 1968.

    Google Scholar 

  16. Massey J L, Shift registers synthesis and BCH decoding, IEEE Trans. Inf. Theory, 1969, 15(1): 122–127.

    Article  MATH  MathSciNet  Google Scholar 

  17. Antweiler M and Bömer L, Complex sequences over GF (pm) with a two-level autocorrelation function and a large linear span, IEEE Trans. Inf. Theory, 1992, 38(1): 120–130.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics and Statistics, Hubei University, Wuhan, 430062, China

    Han Cai & Xiangyong Zeng

  2. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing, 100093, China

    Lei Hu

Authors
  1. Han Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiangyong Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Lei Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xiangyong Zeng.

Additional information

The work of Zeng was supported by the National Natural Science Foundation of China under Grant No. 61170257; The work of Hu was supported by the National Key Basic Research Program of China under Grant No. 2013CB834203, the National Science Foundation of China under Grant Nos. 10990011 and 61070172, and the Strategic Priority Research Program of Chinese Academy of Sciences under Grant No. XDA06010702.

This paper was recommended for publication by Editor LI Ziming.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cai, H., Zeng, X. & Hu, L. Families of p-ary sequences with low correlation and large linear complexity. J Syst Sci Complex 27, 1305–1319 (2014). https://doi.org/10.1007/s11424-014-1243-9

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11424-014-1243-9

Keywords