The Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation

2017/08/18 by Fan, Cuiling
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1708.05480

Abstract

Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed via interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where p is an odd prime with p≡ 1(\bmod~4). The objective of this paper is to determine the minimal polynomial and the linear complexity of this class of binary optimal sequences via sequence polynomial approach. It turns out that this class of sequences has quite good linear complexity.

Related

• Linear Complexity of Binary Interleaved Sequences of Period 4n
• Linear Complexity and Autocorrelation of two Classes of New Interleaved Sequences of Period 2N
• On the 2-adic complexity of a class of binary sequences of period 4p with optimal autocorrelation magnitude
• Linear complexity over \mathbbF_q and 2-adic complexity of a class of binary generalized cyclotomic sequences with low-value autocorrelation
• The 2-adic complexity of a class of binary sequences with optimal autocorrelation magnitude