Skip to main content
SpringerLink
Log in

Sequences with good correlation property based on depth and interleaving techniques

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

A well-known operator of sequences over finite field is the derivative, which is used to investigate the complexity of sequences in game theory, communication theory and cryptography. According to the operator, a corresponding complexity of the sequence is called (the first) depth, which also contributes to another two definitions (the second and third depths) by using polynomial factor and high order difference, respectively. For a sequence of period \(n\) over \(F_q\) (a finite field with \(q\) elements and characteristic \(p\)), the three depths are the same as its linear complexity if \(n=p^r \ (r\ge 0)\). This paper focuses on sequence s of period \(n\) with infinite third depth. For cyclic-left-shift-difference operator \(L-1\) on \({\varvec{s}}\), we generally depict circulant matrix structure of the operator \((L-1)^i\) for all \(i>0\) and determine its rank. Furthermore, our results show that the interleaving technique really works with difference operator on producing sequences with good correlation property and long period, which are constructed from 2-level autocorrelation sequences of period \(2^r-1\) except \(m\)-sequences. The method is lightweight since the computation complexity is \(\Theta (N)\) and only the XOR logical operator is used. In addition, ultimate period of a sequence \(\{(L -1)^{i}({\varvec{s}})\}_{i\ge 0}\) is investigated systematically. Some upper bounds on the ultimate period and a formula to determine the least ultimate period are presented.

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

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Abello J., Pardalos P.M., Resende, M.G.C.: On maximum clique problems in very large graphs. In: Abello J., Vitter J. (eds.) External Memory Algorithms. DIMACS Series on Discrete Mathematics and Theoretical Computer Science 50, pp. 119–130. ISBN 0-8218-1184-3, American Mathematical Society, Providence (1999).

  2. Bar-Yehuda R., Etzion T., Moran S.: Rotating-table games and derivatives of words. Theor. Comput. Sci. 108, 311–329 (1993).

  3. Brualdi R.A.: Introductory Combinatorics, 4th edition. China Machine Press, Beijing (2006).

  4. Dai Z.: On the period of cycling matrix over \(F_q\). Acta Math. Sin. 23(1), 70–77 (1980).

  5. Ding C.: A fast algorithm for determining the linear complexity of sequences over \(GF(p^m)\) with period \(p^n\). IEEE Trans. Inf. Theory 46(6), 2203–2206 (2000).

  6. Ding C., Xiao G.: Stream Cryptography and Its Applications, pp. 39–71. National Defence Industry Press, Beijing (1994).

  7. Etzion T.: The depth distribution-a new characterization for linear codes. IEEE Trans. Inf. Theory 43(4), 1361–1363 (1997).

  8. Etzion T.: Linear complexity of de Bruijn sequences-old and new results. IEEE Trans. Inf. Theory 45(2), 693–698 (1999).

  9. Games R.A.: Cross correlation of \(m\)-sequences and GMW-sequences with the same primitive polynomial. Discret. Appl. Math. 12, 139–146 (1985).

  10. Games R.A., Chan A.H.: A fast algorithm for determining the complexity of a binary sequence with period \(2^n\). IEEE Trans. Inf. Theory 29(1), 144–146 (1983).

  11. Golomb S.W.: Shift Register Sequence. Aegen Park Press, Laguna Hills (1982).

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

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

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

  15. Gong G., Helleseth T.: A three-valued Walsh transform from decimations of Helleseth–Gong sequences. IEEE Trans. Inf. Theory 58(2), 1158–1162 (2012).

  16. Helleseth T., Kumar P.V., Martinson H.: A new family of ternary sequences with ideal two-level autocorrelation function. Des. Codes Cryptogr. 23(2), 157–166 (2001).

  17. Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1983).

  18. Lin S., Costello D.J.: Error Control Coding: Fundamentals and Applications. Englewood Cliffs, Prentice-Hall (1983).

  19. Luo Y., Fu F., Wei V.K.: On the depth distribution of linear codes. IEEE Trans. Inf. Theory 46(6), 2197–2203 (2000).

  20. MacWilliams F.J., Solane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, New York (1997).

  21. Mitchell C.J.: On integer-valued rational polynomials and depth distributions of binary codes. IEEE Trans. Inf. Theory 44(7), 3146–3150 (1998).

  22. Nathanson M.B.: Derivatives of binary sequences. SIAM J. Appl. Math. 21(3), 407–412 (1971).

  23. No J.S., Yang K., Chung H., Song H.Y.: New construction for families of binary sequences with optimal correlation properties. IEEE Trans. Inf. Theory 43(5), 1596–1602 (1997).

  24. Pollard J.M.: Monte Carlo methods for index computation (mod \(p\)). Math. Comput. 32(143), 918–924 (1978).

  25. Robshaw M.J.B.: On evaluating the linear complexity of a sequence of least period \(2^n\). Des. Codes Cryptogr. 4, 263–269 (1994).

  26. Rosen K.H.: Elementary Number Theory and Its Applications, 4th edn, pp. 53–61, 222–229. China Machine Press, Beijing (2004).

  27. Roth R.M.: Private communication to Etzion T.

  28. Teske E.: Speeding Up Pollard’s Rho Method for Computing Discrete Logarithms. Algorithmic Number Theory Seminar ANTS-III. Lecture Notes in Computer Science, vol. 1423, pp. 541–554. Springer, Berlin (1998).

  29. Zeng M., Luo Y., Gong G.: Rotating-table game and construction of periodic sequences with lightweight calculation. In: Proceedings of the IEEE International Symposium of Information Theroy, Boston, MA, pp. 1–6 (2012).

  30. Zhang G., Zhou Q.: Pseudonoise codes constructed by Legendre sequence. Electron. Lett. 38(8), 376–377 (2001).

Download references

Acknowledgments

The authors would like to thank the anonymous referees for their valuable suggestions and detailed comments that improved this paper. This work was supported in part by the National 973 Project of China under Grant No. 2013CB338004, the National Natural Science Foundation of China under Grants 61271222, and the Innovation Program of Shanghai Municipal Education Commission under Grant 14ZZ017.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai , 200240, People’s Republic of China

    Min Zeng & Yuan Luo

  2. Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON , N2L3G1, Canada

    Guang Gong

Authors
  1. Min Zeng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuan Luo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guang Gong
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuan Luo.

Additional information

Communicated by T. Etzion.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zeng, M., Luo, Y. & Gong, G. Sequences with good correlation property based on depth and interleaving techniques. Des. Codes Cryptogr. 77, 255–275 (2015). https://doi.org/10.1007/s10623-014-0004-z

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10623-014-0004-z

Keywords

Mathematics Subject Classification

Search

Navigation