Advertisement

The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude

  • Yuhua Sun
  • Tongjiang YanEmail author
  • Zhixiong Chen
  • Lianhai Wang
Article
  • 33 Downloads

Abstract

Recently, a class of binary sequences with optimal autocorrelation magnitude has been presented by Su et al. based on Ding-Helleseth-Lam sequences and interleaving technique (Designs, Codes and Cryptography 86, 1329–1338, 2018). The linear complexity of this class of sequences has been proved to be large enough to resist the B-M Algorithm by Fan (Designs, Codes and Cryptography 86, 2441–2450, 2018). In this paper, we study the 2-adic complexities of these sequences with period 4p and show they are no less than 2p, i.e., its 2-adic complexity is large enough to resist the Rational Approximation Algorithm.

Keywords

Cyclotomic sequence Interleaved sequence Optimal autocorrelation 2-adic complexity 

Mathematics Subject Classification (2010)

11 Bxx 

Notes

Acknowledgments

Parts of this work were suggested by Prof. Qiang Wang who works in School of Mathematics and Statistics, Carleton University. The authors wish to thank his good suggestions.

References

  1. 1.
    Arasu, K. T., Ding, C., Helleseth, T., Kumar, P. V., Martinsen, H. M.: Almost difference sets and their sequences with optimal autocorrelation. IEEE Trans. Inform. Theory 47, 2934–2943 (2001)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Ding, C., Helleseth, T., Lam, K. Y.: Several classes of sequences with three-level autocorrelation. IEEE Trans. Inform. Theory 45, 2606–2612 (1999)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Fan, C.: The linear complexity of a class of binary sequences with optimal autocorrelation. Des. Codes Crypt. 86, 2441–2450 (2018)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Gong, G.: Theory and applications of q-ary interleaved sequences. IEEE Trans. Inform. Theory 41, 400–411 (1995)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Hu, H.: Comments on “a new method to compute the 2-adic complexity of binary sequences”. IEEE Trans. Inform. Theory 60, 5803–5804 (2014)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Klapper, A., Goresky, M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptol. 10, 111–147 (1997)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Li, N., Tang, X.: On the linear complexity of binary sequences of period 4N with optimal autocorrelation/magnitude. IEEE Trans. Inform. Theory 57, 7597–7604 (2011)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Su, W., Yang, Y., Fan, C.: New optimal binary sequences with period 4p via interleaving Ding-Helleseth-Lam sequences. Des. Codes Crypt. 86, 1329–1338 (2018)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Sun, Y., Wang, Q., Yan, T.: The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation. Cryptogr. Commun. 10, 467–477 (2018)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Tang, X., Ding, C.: New classes of balanced quaternary and almost balanced binary sequences with optimal autocorrelation value. IEEE Trans. Inform. Theory 56, 6398–6405 (2010)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Tang, X., Gong, G.: New constructions of binary sequences with optimal autocorrelation value/magnitude. IEEE Trans. Inform. Theory 56, 1278–1286 (2010)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Wang, Q., Du, X.: The linear complexity of binary sequences with optimal autocorrelation. IEEE Trans. Inform. Theory 56, 6388–6397 (2010)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Xiong, H., Qu, L., Li, C.: A new method to compute the 2-adic complexity of binary sequences. IEEE Trans. Inform. Theory 60, 2399–2406 (2014)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Xiong, H., Qu, L., Li, C.: 2-Adic complexity of binary sequences with interleaved structure. Finite Fields and Their Applications 33, 14–28 (2015)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Yan, T., Chen, Z., Li, B.: A general construction of binary interleaved sequences of period 4N with optimal autocorrelation. Inform. Sci. 287, 26–31 (2014)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Yang, M., Zhang, L., Feng, K.: On the 2-adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude. arXiv:1904.13012

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  • Yuhua Sun
    • 1
    • 2
    • 3
  • Tongjiang Yan
    • 1
    Email author
  • Zhixiong Chen
    • 2
  • Lianhai Wang
    • 3
  1. 1.College of SciencesChina University of PetroleumQingdaoChina
  2. 2.Provincial Key Laboratory of Applied MathematicsPutian UniversityPutianChina
  3. 3.Shandong Computer Science Center (National Supercomputer Center in Jinan), Shandong Provincial Key Laboratory of Computer NetworksQilu University of Technology (Shandong Academy of Sciences)JinanChina

Personalised recommendations