New construction for binary sequences of period pm - 1 with optimal autocorrelation using (z + 1)d + azd + b

Jong Seon No, Habong Chung, Hong-Yeop Song, Kyeongcheol Yang, Jung Do Lee, Tor Helleseth

Research output: Contribution to journalLetter

23 Citations (Scopus)

Abstract

In this correspondence, we present a construction for binary sequences (s(t)) of period N = pm - 1 for an odd prime p based on the polynomial (z + 1)d + azd + b, and discuss them in some cases of parameters p, m, d, a, and b. We show that new sequences from our construction are balanced or almost balanced and have optimal three-level autocorrelation for the case when the polynomial (z + 1)d + zd + a can be transformed into the form z2 - c. We also derive the distribution of autocorrelation values they take on. The sequences satisfy constant-on-the-coset property, and we will show that there are more than one characteristic phases with constant-on-the-coset property. Some other interesting properties of these sequences will be presented. For the cases when the polynomial (z + 1)d + zd + a cannot be transformed into the form z2 - c, we performed extensive computer search, and results are summarized. Based on these results, some open problems are formulated.

Original languageEnglish
Pages (from-to)1638-1644
Number of pages7
JournalIEEE Transactions on Information Theory
Volume47
Issue number4
DOIs
Publication statusPublished - 2001 Jan 1

Fingerprint

Binary sequences
Autocorrelation
Polynomials
Values

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

No, Jong Seon ; Chung, Habong ; Song, Hong-Yeop ; Yang, Kyeongcheol ; Lee, Jung Do ; Helleseth, Tor. / New construction for binary sequences of period pm - 1 with optimal autocorrelation using (z + 1)d + azd + b. In: IEEE Transactions on Information Theory. 2001 ; Vol. 47, No. 4. pp. 1638-1644.
@article{82d91b64691c459c98da9c50fc125d82,
title = "New construction for binary sequences of period pm - 1 with optimal autocorrelation using (z + 1)d + azd + b",
abstract = "In this correspondence, we present a construction for binary sequences (s(t)) of period N = pm - 1 for an odd prime p based on the polynomial (z + 1)d + azd + b, and discuss them in some cases of parameters p, m, d, a, and b. We show that new sequences from our construction are balanced or almost balanced and have optimal three-level autocorrelation for the case when the polynomial (z + 1)d + zd + a can be transformed into the form z2 - c. We also derive the distribution of autocorrelation values they take on. The sequences satisfy constant-on-the-coset property, and we will show that there are more than one characteristic phases with constant-on-the-coset property. Some other interesting properties of these sequences will be presented. For the cases when the polynomial (z + 1)d + zd + a cannot be transformed into the form z2 - c, we performed extensive computer search, and results are summarized. Based on these results, some open problems are formulated.",
author = "No, {Jong Seon} and Habong Chung and Hong-Yeop Song and Kyeongcheol Yang and Lee, {Jung Do} and Tor Helleseth",
year = "2001",
month = "1",
day = "1",
doi = "10.1109/18.923752",
language = "English",
volume = "47",
pages = "1638--1644",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

New construction for binary sequences of period pm - 1 with optimal autocorrelation using (z + 1)d + azd + b. / No, Jong Seon; Chung, Habong; Song, Hong-Yeop; Yang, Kyeongcheol; Lee, Jung Do; Helleseth, Tor.

In: IEEE Transactions on Information Theory, Vol. 47, No. 4, 01.01.2001, p. 1638-1644.

Research output: Contribution to journalLetter

TY - JOUR

T1 - New construction for binary sequences of period pm - 1 with optimal autocorrelation using (z + 1)d + azd + b

AU - No, Jong Seon

AU - Chung, Habong

AU - Song, Hong-Yeop

AU - Yang, Kyeongcheol

AU - Lee, Jung Do

AU - Helleseth, Tor

PY - 2001/1/1

Y1 - 2001/1/1

N2 - In this correspondence, we present a construction for binary sequences (s(t)) of period N = pm - 1 for an odd prime p based on the polynomial (z + 1)d + azd + b, and discuss them in some cases of parameters p, m, d, a, and b. We show that new sequences from our construction are balanced or almost balanced and have optimal three-level autocorrelation for the case when the polynomial (z + 1)d + zd + a can be transformed into the form z2 - c. We also derive the distribution of autocorrelation values they take on. The sequences satisfy constant-on-the-coset property, and we will show that there are more than one characteristic phases with constant-on-the-coset property. Some other interesting properties of these sequences will be presented. For the cases when the polynomial (z + 1)d + zd + a cannot be transformed into the form z2 - c, we performed extensive computer search, and results are summarized. Based on these results, some open problems are formulated.

AB - In this correspondence, we present a construction for binary sequences (s(t)) of period N = pm - 1 for an odd prime p based on the polynomial (z + 1)d + azd + b, and discuss them in some cases of parameters p, m, d, a, and b. We show that new sequences from our construction are balanced or almost balanced and have optimal three-level autocorrelation for the case when the polynomial (z + 1)d + zd + a can be transformed into the form z2 - c. We also derive the distribution of autocorrelation values they take on. The sequences satisfy constant-on-the-coset property, and we will show that there are more than one characteristic phases with constant-on-the-coset property. Some other interesting properties of these sequences will be presented. For the cases when the polynomial (z + 1)d + zd + a cannot be transformed into the form z2 - c, we performed extensive computer search, and results are summarized. Based on these results, some open problems are formulated.

UR - http://www.scopus.com/inward/record.url?scp=0035334482&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035334482&partnerID=8YFLogxK

U2 - 10.1109/18.923752

DO - 10.1109/18.923752

M3 - Letter

AN - SCOPUS:0035334482

VL - 47

SP - 1638

EP - 1644

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

ER -