Skip to main content
Log in

Linear complexity of two classes of quaternary sequences based on sign alternation transformation

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

Two classes of optimal quaternary sequences have been constructed by applying the sign alternation transform and Gray mapping to Legendre sequence pair, twin-prime sequence pair and GMW sequence pair. In this paper, a new method for investigating the linear complexity over finite field is proposed, and the exact values of the linear complexity over finite field \({\mathbb {F}}_4\) and Galois ring \({\mathbb {Z}}_4\) of the quaternary sequences are determined. The results show that their linear complexity are quite good.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Zhao, L.: About the linear complexity of quaternary sequences with even length. Cryptogr. Commun. 12, 725–741 (2020)

    Article  MathSciNet  Google Scholar 

  2. Edemsiy, V., Ivanov, A.: Autocorrelation and linear complexity of quaternary sequences of period \(2p\) based on cyclotomic classes of order four. IEEE International symposium on information theory 47, 3120–3124 (2013)

  3. Yang, Z., Ke, P.H.: Quaternary sequences with odd period and low autocorrelation. Electron Lett 46(15), 1068–1069 (2011)

    Article  Google Scholar 

  4. Ke, P.H., Lin, C.L., Zhang, S.Y.: Linear complexity of quaternary sequences with odd period and low autocorrelation. J China Univers Post Telecommun 21(5), 89–93 (2014)

    Article  Google Scholar 

  5. Edemskiy, V., Ivanov, A.: Linear complexity of quaternary sequences of length pq with low autocorrelation. J. Computat. & Appl. Math. 259(4), 555–560 (2014)

    Article  MathSciNet  Google Scholar 

  6. Yang, Y., Li, C.L.: New quaternary sequences with optimal odd-periodic autocorrelation magnitude. Cryptogr. Communicat. 12, 363–374 (2020)

    Article  MathSciNet  Google Scholar 

  7. Su, W., Yang, Y., Zhou, Z.C., Tang, X.H.: New quaternary sequences of even length with optimal auto-correlation. Sci. China Info. Sci. 61(2), 022308 (2018)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  9. Ding, C.: Linear complexity of generalized cyclotomic binary sequences of order 2. Finite Field. Their Appl. 3, 159–174 (1997)

    Article  MathSciNet  Google Scholar 

  10. Edemsiy, V., Ivanov, A.: About the linear complexity of sequences over the finite field obtained by inverse Gray mapping from binary sequences. Int. J. Math. Comput. Simul. 9, 141–145 (2015)

    Google Scholar 

  11. Lidl, R., Niederreiter, H.: Finite fields, in encyclopedia of mathematics and its applications, 2nd edn. Cambridge Univ. Press, Cambridge, U.K. (1997)

    Google Scholar 

  12. Udaya, P., Siddiqi, M.U.: Generalized GMW quadriphase sequences satisfying the Welch bound with equality. Applicab. Algeb. Eng., Commun. Comput. 10, 203–225 (2000)

    Article  MathSciNet  Google Scholar 

  13. Chen, Z.X., Edemskiy, V.: Linear complexity of quaternary sequences over \({\mathbb{Z}}_4\) derived from generalized cyclotomic classes modulo \(2p\). Int. J. Netw. Secur. 19(4), 613–622 (2017)

  14. Ding, C.: On the linear compelxity of legendre sequences. IEEE Trans. Info. Theory 44(3), 1276–1278 (1998)

    Article  Google Scholar 

  15. Xiong, H., Qu, L.J., Li, C., Fu, S.J.: Linear complexity of binary sequences with interleaved structure. IET Commun. 7(15), 1688–1696 (2013)

    Article  Google Scholar 

  16. Zhao, L., Wen, Q.Y., Zhang, J.: On the linear complexity of a class of quaternary sequences with low autocorrelation. IEICE Trans. Fund. E96–A(5), 997–1000 (2013)

    Article  Google Scholar 

  17. Whiteman, A.L.: A family of difference sets. Illin. J. Math. 6(1), 107–121 (1962)

    MathSciNet  MATH  Google Scholar 

  18. Edemsiy, V., Ivanov, A.: The linear complexity of balanced quaternary sequences with optimal autocorrelation value. Cryptogr. Commun. 7, 485–496 (2015)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors wish to thank the referees for their detailed and very helpful comments and suggestions that much improved this paper. The works was supported by National Natural Science Foundation of China (Grant Nos. 61701343, U1404601, 11571094, 11971004), Humanity and Social Science Youth foundation of Ministry of Education of China (Grant Nos. 20YJC910009).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lu Zhao.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhao, L., Pei, Y., Cao, T. et al. Linear complexity of two classes of quaternary sequences based on sign alternation transformation. AAECC (2022). https://doi.org/10.1007/s00200-022-00559-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00200-022-00559-2

Keywords

Navigation