A Construction of Odd Length Generators for Optimal Families of Perfect Sequences

Min Kyu Song, Hong-Yeop Song

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, we give a construction of optimal families of N-ary perfect sequences of period N2, where N is a positive odd integer. For this, we re-define perfect generators and optimal generators of any length N which were originally defined only for odd prime lengths by Park, Song, Kim, and Golomb in 2016, but investigate the necessary and sufficient condition for these generators for arbitrary length N. Based on this, we propose a construction of odd length optimal generators by using odd prime length optimal generators. For a fixed odd integer N and its odd prime factor p, the proposed construction guarantees at least (N/p)p-1φ(N/p)φ(p)φ(p-1)/φ(N)2 inequivalent optimal generators of length N in the sense of constant multiples, cyclic shifts, and/or decimations. Here, φ (·) is Euler's totient function. From an optimal generator one can construct lots of different N-ary optimal families of period N2, all of which contain pmin -1 perfect sequences, where pmin is the least positive prime factor of N.

Original languageEnglish
Pages (from-to)2901-2909
Number of pages9
JournalIEEE Transactions on Information Theory
Volume64
Issue number4
DOIs
Publication statusPublished - 2018 Apr 1

Fingerprint

song
guarantee

All Science Journal Classification (ASJC) codes

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

Cite this

@article{0e157c4ad8304e99bbf7da90ad1ad94b,
title = "A Construction of Odd Length Generators for Optimal Families of Perfect Sequences",
abstract = "In this paper, we give a construction of optimal families of N-ary perfect sequences of period N2, where N is a positive odd integer. For this, we re-define perfect generators and optimal generators of any length N which were originally defined only for odd prime lengths by Park, Song, Kim, and Golomb in 2016, but investigate the necessary and sufficient condition for these generators for arbitrary length N. Based on this, we propose a construction of odd length optimal generators by using odd prime length optimal generators. For a fixed odd integer N and its odd prime factor p, the proposed construction guarantees at least (N/p)p-1φ(N/p)φ(p)φ(p-1)/φ(N)2 inequivalent optimal generators of length N in the sense of constant multiples, cyclic shifts, and/or decimations. Here, φ (·) is Euler's totient function. From an optimal generator one can construct lots of different N-ary optimal families of period N2, all of which contain pmin -1 perfect sequences, where pmin is the least positive prime factor of N.",
author = "Song, {Min Kyu} and Hong-Yeop Song",
year = "2018",
month = "4",
day = "1",
doi = "10.1109/TIT.2018.2801796",
language = "English",
volume = "64",
pages = "2901--2909",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

A Construction of Odd Length Generators for Optimal Families of Perfect Sequences. / Song, Min Kyu; Song, Hong-Yeop.

In: IEEE Transactions on Information Theory, Vol. 64, No. 4, 01.04.2018, p. 2901-2909.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A Construction of Odd Length Generators for Optimal Families of Perfect Sequences

AU - Song, Min Kyu

AU - Song, Hong-Yeop

PY - 2018/4/1

Y1 - 2018/4/1

N2 - In this paper, we give a construction of optimal families of N-ary perfect sequences of period N2, where N is a positive odd integer. For this, we re-define perfect generators and optimal generators of any length N which were originally defined only for odd prime lengths by Park, Song, Kim, and Golomb in 2016, but investigate the necessary and sufficient condition for these generators for arbitrary length N. Based on this, we propose a construction of odd length optimal generators by using odd prime length optimal generators. For a fixed odd integer N and its odd prime factor p, the proposed construction guarantees at least (N/p)p-1φ(N/p)φ(p)φ(p-1)/φ(N)2 inequivalent optimal generators of length N in the sense of constant multiples, cyclic shifts, and/or decimations. Here, φ (·) is Euler's totient function. From an optimal generator one can construct lots of different N-ary optimal families of period N2, all of which contain pmin -1 perfect sequences, where pmin is the least positive prime factor of N.

AB - In this paper, we give a construction of optimal families of N-ary perfect sequences of period N2, where N is a positive odd integer. For this, we re-define perfect generators and optimal generators of any length N which were originally defined only for odd prime lengths by Park, Song, Kim, and Golomb in 2016, but investigate the necessary and sufficient condition for these generators for arbitrary length N. Based on this, we propose a construction of odd length optimal generators by using odd prime length optimal generators. For a fixed odd integer N and its odd prime factor p, the proposed construction guarantees at least (N/p)p-1φ(N/p)φ(p)φ(p-1)/φ(N)2 inequivalent optimal generators of length N in the sense of constant multiples, cyclic shifts, and/or decimations. Here, φ (·) is Euler's totient function. From an optimal generator one can construct lots of different N-ary optimal families of period N2, all of which contain pmin -1 perfect sequences, where pmin is the least positive prime factor of N.

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

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

U2 - 10.1109/TIT.2018.2801796

DO - 10.1109/TIT.2018.2801796

M3 - Article

AN - SCOPUS:85041671360

VL - 64

SP - 2901

EP - 2909

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 4

ER -