New constructions of binary sequences with optimal autocorrelation value/magnitude

  • Authors:
  • Xiaohu Tang;Guang Gong

  • Affiliations:
  • Provincial Key Lab of Information Coding and Transmission, Institute of Mobile Communications, Southwest Jiaotong University, Chengdu, China;Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2010

Quantified Score

Hi-index 754.90

Visualization

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 et al. 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.