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

Cryptography and Communications - Tập 12 Số 4 - Trang 675-683 - 2020
Yeneng Sun1,2,3, Tao Yan1, Zhixiong Chen2, Lianhai Wang3
1College of Sciences, China University of Petroleum, Qingdao, China
2Provincial Key Laboratory of Applied Mathematics, Putian University, Putian, China
3Shandong Computer Science Center (National Supercomputer Center in Jinan), Shandong Provincial Key Laboratory of Computer Networks, Qilu University of Technology (Shandong Academy of Sciences), Jinan, China

Tóm tắt

Từ khóa


Tài liệu tham khảo

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)

Ding, C., Helleseth, T., Lam, K. Y.: Several classes of sequences with three-level autocorrelation. IEEE Trans. Inform. Theory 45, 2606–2612 (1999)

Fan, C.: The linear complexity of a class of binary sequences with optimal autocorrelation. Des. Codes Crypt. 86, 2441–2450 (2018)

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

Hu, H.: Comments on “a new method to compute the 2-adic complexity of binary sequences”. IEEE Trans. Inform. Theory 60, 5803–5804 (2014)

Klapper, A., Goresky, M.: Feedback shift registers, 2-adic span, and combiners with memory. J. Cryptol. 10, 111–147 (1997)

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)

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)

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)

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)

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

Wang, Q., Du, X.: The linear complexity of binary sequences with optimal autocorrelation. IEEE Trans. Inform. Theory 56, 6388–6397 (2010)

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)

Xiong, H., Qu, L., Li, C.: 2-Adic complexity of binary sequences with interleaved structure. Finite Fields and Their Applications 33, 14–28 (2015)

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)

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