Linear complexity and 2-adic complexity of binary interleaved sequences with optimal autocorrelation magnitude

AIMS Mathematics

article

Yan Wang¹  Ying Cao¹  Ziling Heng²  Weiqiong Wang² 

[1] School of Science, Xi'an University of Architecture and Technology;School of Science, Chang'an University

关键词: binary sequences;    interleaved sequences;    linear complexity;    2-adic complexity;    autocorrelation;   

DOI  :  10.3934/math.2022760

学科分类：地球科学(综合)

来源: AIMS Press

【 摘 要 】

A construction of binary sequences with period $ 4N $ and optimal autocorrelation magnitude has been investigated based on sampling and interleaving technique. We determine the exact value of the linear complexity of the constructed sequences according to the deep relationship among the characteristic polynomials, and show it is $ 2N+2 $. Moreover, we determine the 2-adic complexity of these sequences by the autocorrelation function, and show it can attain the maximum value. Results show that such sequences can resist both the Berlekamp-Massey attack and the Rational Approximation Algorithm, in addition are good for communication.

【 授权许可】

CC BY