EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 59 (2025) RAIRO-Theor. Inf. Appl., 59 (2025) 9 References
Open Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 59, 2025
Article Number 9
Number of page(s) 12
DOI https://doi.org/10.1051/ita/2025004
Published online 09 September 2025
  1. V. Edemskiy, On the linear complexity of interleaved binary sequences of period 4p obtained from Hall sequences or Legendre and Hall sequences. Electron. Lett. 50 (2014) 604–605. [Google Scholar]
  2. V. Edemskiy and A. Palvinskiy, The linear complexity of binary sequences of length 2p with optimal three-level autocorrelation. Inf. Process. Lett. 116 (2016) 153–156. [Google Scholar]
  3. C. Fan, The linear complexity of a class of binary sequences with optimal autocorrelation. Des. Codes Cryptogr. 86 (2018) 2441–2450. [Google Scholar]
  4. R. Hofer and A. Winterhof, On the 2-adic complexity of the two-prime generator. IEEE Trans. Inf. Theory 64 (2018) 5957–5960. [Google Scholar]
  5. H. Hu, Comments on a new method to compute the 2-adic complexity of binary sequences. IEEE Trans. Inf. Theory 60 (2004) 5803–5804. [Google Scholar]
  6. N. Li and X. Tang, On the linear complexity of binary sequences of period 4N with optimal autocorrelation value/magnitude. IEEE Trans. Inf. Theory 57 (2011) 7597–7604. [Google Scholar]
  7. W. Su, Y. Yang and C. Fan, New optimal binary sequences with period 4p via interleaving Ding–Helleseth-Lam sequences. Des. Codes Cryptogr. 86 (2018) 1329–1338. [Google Scholar]
  8. Y. Sun, Q. Wang and T. Yan, A lower bound on the 2-adic complexity of modified Jacobi sequences. Cryptogr. Commun. 11 (2019) 337–349. [CrossRef] [MathSciNet] [Google Scholar]
  9. Y. Sun, Q. Wang and T. Yan, The exact autocorrelation distribution and 2-adic complexity of a class of binary sequences with almost optimal autocorrelation. Cryptogr. Commun. 10 (2018) 467–477. [Google Scholar]
  10. Y. Sun, T. Yan and H. Li, The linear complexity of a class of binary sequences with three-level autocorrelation. IEICE Trans. Fundam. E96-A (2013) 1586–1592. [Google Scholar]
  11. T. Tian and W. Qi, 2-adic complexity of binary m-sequences. IEEE Trans. Inf. Theory 56 (2010) 450–454. [Google Scholar]
  12. Q. Wang and X. Du, The linear complexity of binary sequences with optimal autocorrelation. IEEE Trans. Inf. Theory 56 (2010) 6388–6397. [Google Scholar]
  13. Q. Wang, The linear complexity of some binary sequences with three-level autocorrelation. IEEE Trans. Inf. Theory 57 (2010) 4046–4052. [Google Scholar]
  14. H. Xiong, L. Qu and C. Li, A new method to compute the 2-adic complexity of binary sequences. IEEE Trans. Inf. Theory 60 (2014) 2399–2406. [Google Scholar]
  15. H. Xiong, L. Qu and C. Li, 2-adic complexity of binary sequences with interleaved structure. Finite Fields Appl. 33 (2015) 14–28. [CrossRef] [MathSciNet] [Google Scholar]
  16. J. Zhang and C. Zhao, The linear complexity of a class of binary sequences with period 2p. Algebra Eng. Commun. Comput. 26 (2015) 475–491. [Google Scholar]
  17. L. Zhang, J. Zhang, M. Yang and K. Feng, On the 2-adic complexity of the Ding–Helleseth–Martinsen binary sequences. IEEE Trans. Inf. Theory 66 (2020) 4613–4620. [Google Scholar]
  18. J.L. Massey, Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15 (1969) 122–127. [Google Scholar]
  19. A. Klapper and M. Goresky, Cryptanalysis based on 2-adic rational approximation. In: CRYPTO 1995, LNCS 963 (1995) 262–273. [Google Scholar]
  20. A. Klapper and M. Goresky, Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptol. 10 (1997) 111–147. [CrossRef] [Google Scholar]
  21. T. Storer, Cyclotomy and Difference Sets. Markham, Chicago, IL (1967). [Google Scholar]
  22. C. Ding, T.H. Helleseth and H. Martinsen, New families of binary sequences with optimal three-level autocorrelation. IEEE Trans. Inf. Theory 47 (2001) 428–433. [Google Scholar]
  23. C. Ding, T.H. Helleseth and K.Y. Lam, Several classes of sequences with three-level autocorrelation. IEEE Trans. Inf. Theory 45 (1999) 2606–2612. [Google Scholar]
  24. B. Berndt, R. Evans and K. Williams, Gauss and Jacobi Sums. John Wiley and Sons Inc. (1998). [Google Scholar]
  25. T.W. Cusick, C. Ding and A. Renvall, Stream Ciphers and Number Theory. North-Holland Mathematical Library 55. North-Holland/Elsevier, Amsterdam, The Netherlands (1998). [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.