Papers
Topics
Authors
Recent
2000 character limit reached

New Optimal Binary Sequences with Period $4p$ via Interleaving Ding-Helleseth-Lam Sequences

Published 26 May 2017 in cs.IT and math.IT | (1705.09623v1)

Abstract: 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 $p$, where $p$ is an odd prime with $p\equiv 1(\bmod~4)$. The objective of this letter is to present a construction of binary sequences of period $4p$ 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.

Citations (14)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (3)

Collections

Sign up for free to add this paper to one or more collections.