10,232 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
A Family of Binary Sequences with Optimal Correlation Property and Large Linear Span
A family of binary sequences is presented and proved to have optimal
correlation property and large linear span. It includes the small set of Kasami
sequences, No sequence set and TN sequence set as special cases. An explicit
lower bound expression on the linear span of sequences in the family is given.
With suitable choices of parameters, it is proved that the family has
exponentially larger linear spans than both No sequences and TN sequences. A
class of ideal autocorrelation sequences is also constructed and proved to have
large linear span.Comment: 21 page
Binary matrices of optimal autocorrelations as alignment marks
We define a new class of binary matrices by maximizing the peak-sidelobe
distances in the aperiodic autocorrelations. These matrices can be used as
robust position marks for in-plane spatial alignment. The optimal square
matrices of dimensions up to 7 by 7 and optimal diagonally-symmetric matrices
of 8 by 8 and 9 by 9 were found by exhaustive searches.Comment: 8 pages, 6 figures and 1 tabl
- …