5 research outputs found
New Optimal Binary Sequences with Period via Interleaving Ding-Helleseth-Lam Sequences
Binary sequences with optimal autocorrelation play important roles in radar,
communication, and cryptography. Finding new binary sequences with optimal
autocorrelation has been an interesting research topic in sequence design.
Ding-Helleseth-Lam sequences are such a class of binary sequences of period
, where is an odd prime with . The objective of this
letter is to present a construction of binary sequences of period via
interleaving four suitable Ding-Helleseth-Lam sequences. This construction
generates new binary sequences with optimal autocorrelation which can not be
produced by earlier ones
Correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences
Sequences with optimal autocorrelation properties play an important role in wireless communication, radar and cryptography. Interleaving is a very important method in constructing the optimal autocorrelation sequence. Tang and Gong gave three different constructions of interleaved sequences (generalized GMW sequences, twin prime sequences and Legendre sequences). Su et al. constructed a series of sequences with optimal autocorrelation magnitude via interleaving Ding-Helleseth-Lam sequences. In this paper we further study the correlation properties of interleaved Legendre sequences and Ding-Helleseth-Lam sequences
Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients
We first introduce a family of binary -periodic sequences based on the Euler quotients modulo , where and are two distinct odd primes and divides . The minimal polynomials and linear complexities are determined for the proposed sequences provided that . The results show that the proposed sequences have high linear complexities