The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude
- 33 Downloads
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.
KeywordsCyclotomic sequence Interleaved sequence Optimal autocorrelation 2-adic complexity
Mathematics Subject Classification (2010)11 Bxx
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.
- 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