New constructions of binary sequences with optimal autocorrelation value/magnitude

81Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we give three new constructions of binary sequences of period 4N with optimal autocorrelation value or optimal autocorrelation magnitude using N ×4 interleaved sequences. Yu and Gong recently found any binary sequence of period 4N with optimal autocorrelation value constructed from an almost difference set by Arasu is an N ×4 interleaved sequence for which all four columns in its N ×4 array are shift equivalent up to the complement. We found that it is not necessary that four columns are shift equivalent. Instead, it could be a pair of related sequences together with their shifts as the column sequences. The first construction is to use a generalized GMW sequence of period N=22k-1 and its modified version, the second construction is to use a twin prime sequence of length N=p(p+2) and its modified version, and the third construction, a pair of Legendre sequences of period N=p (p odd prime) with their respective first terms complementary (the 2-level autocorrelation property is not needed for the Legendre sequence). The comparison with the known constructions are given. For the new sequences with optimal autocorrelation value, their corresponding new almost difference sets are also derived. © 2006 IEEE.

Cite

CITATION STYLE

APA

Tang, X., & Gong, G. (2010). New constructions of binary sequences with optimal autocorrelation value/magnitude. IEEE Transactions on Information Theory, 56(3), 1278–1286. https://doi.org/10.1109/TIT.2009.2039159

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free