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

Research output: Contribution to journalConference article

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.

Original languageEnglish
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - 2000 Dec 1
Event2000 IEEE International Symposium on Information Theory - Serrento, Italy
Duration: 2000 Jun 252000 Jun 30

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Balanced and almost balanced binary sequences of period p<sup>m</sup> - 1 with optimal autocorrelation using the polynomial (z + 1)<sup>d</sup> + az<sup>d</sup> + b over GF(p<sup>m</sup>)'. Together they form a unique fingerprint.

  • Cite this