Balanced and almost balanced binary sequences of period pm - 1 with optimal autocorrelation using the polynomial (z + 1)d + azd + b over GF(pm)

J. S. No; H. Chung; H. Y. Song; K. Yang; J. D. Lee; T. Helleseth

Balanced and almost balanced binary sequences of period p^m - 1 with optimal autocorrelation using the polynomial (z + 1)^d + az^d + b over GF(p^m)

J. S. No, H. Chung, H. Y. Song, K. Yang, J. D. Lee, T. Helleseth

Department of Electrical and Electronic Engineering

Research output: Contribution to journal › Conference article › peer-review

Abstract

In this paper, we present a construction for binary sequences {s(t)} of period N = p^m - 1 for an odd prime p based on the polynomial (z + 1)^d + az^d + b with optimal three-level autocorrelation.

Original language	English
Pages (from-to)	299
Number of pages	1
Journal	IEEE International Symposium on Information Theory - Proceedings
Publication status	Published - 2000
Event	2000 IEEE International Symposium on Information Theory - Serrento, Italy Duration: 2000 Jun 25 → 2000 Jun 30

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Cite this

@article{3a035e1441f0458d8837538049920920,

title = "Balanced and almost balanced binary sequences of period pm - 1 with optimal autocorrelation using the polynomial (z + 1)d + azd + b over GF(pm)",

abstract = "In this paper, 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 with optimal three-level autocorrelation.",

author = "No, {J. S.} and H. Chung and Song, {H. Y.} and K. Yang and Lee, {J. D.} and T. Helleseth",

year = "2000",

language = "English",

pages = "299",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "2000 IEEE International Symposium on Information Theory ; Conference date: 25-06-2000 Through 30-06-2000",

}

TY - JOUR

T1 - Balanced and almost balanced binary sequences of period pm - 1 with optimal autocorrelation using the polynomial (z + 1)d + azd + b over GF(pm)

AU - No, J. S.

AU - Chung, H.

AU - Song, H. Y.

AU - Yang, K.

AU - Lee, J. D.

AU - Helleseth, T.

PY - 2000

Y1 - 2000

N2 - In this paper, 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 with optimal three-level autocorrelation.

AB - In this paper, 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 with optimal three-level autocorrelation.

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

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

M3 - Conference article

AN - SCOPUS:0034447237

SN - 2157-8095

SP - 299

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

T2 - 2000 IEEE International Symposium on Information Theory

Y2 - 25 June 2000 through 30 June 2000

ER -

Balanced and almost balanced binary sequences of period p^m - 1 with optimal autocorrelation using the polynomial (z + 1)^d + az^d + b over GF(p^m)

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this