18 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
Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization
Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise
to optimal frequency-hopping sequences and optimal comma-free codes. New
constructions for PCDPs, based on almost difference sets and cyclic difference
matrices, are given. These produce new infinite families of optimal PCDPs (and
hence optimal frequency-hopping sequences and optimal comma-free codes). The
existence problem for optimal PCDPs in , with base blocks
of size three, is also solved for all .Comment: to appear in IEEE Transactions on Information Theor