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

Min Kyu Song, Hong Yeop Song

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)


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
Issue number4
Publication statusPublished - 2018 Apr

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'A Construction of Odd Length Generators for Optimal Families of Perfect Sequences'. Together they form a unique fingerprint.

Cite this