Set Size Bound for Aperiodic Z-Complementary Code Sets

Cheng Yu Pai; Yu Che Tung; Zhen Ming Huang; Chao Yu Chen

doi:10.1109/LSP.2025.3537996

Set Size Bound for Aperiodic Z-Complementary Code Sets

Cheng Yu Pai
, Yu Che Tung
, Zhen Ming Huang
, Chao Yu Chen

Institute of Computer and Communication Engineering

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

The widely and commonly adopted upper bound on the set size of aperiodic Z-complementary code sets (ZCCSs) in the literature has been a conjecture. In this letter, we provide detailed derivations of a conjectured bound on the set size of multiphase ZCCSs. A multiphase ZCCS is optimal when its set size reaches the upper bound. Furthermore, we propose a new construction of ZCCSs based on extended generalized Boolean functions (EGBFs). The proposed method introduces optimal ZCCSs with new parameters.

Original language	English
Pages (from-to)	1021-1025
Number of pages	5
Journal	IEEE Signal Processing Letters
Volume	32
DOIs	https://doi.org/10.1109/LSP.2025.3537996
Publication status	Published - 2025

All Science Journal Classification (ASJC) codes

Signal Processing
Electrical and Electronic Engineering
Applied Mathematics

Access to Document

10.1109/LSP.2025.3537996

Cite this

@article{ceb20b12c5f645289fa07ed988db5a96,

title = "Set Size Bound for Aperiodic Z-Complementary Code Sets",

abstract = "The widely and commonly adopted upper bound on the set size of aperiodic Z-complementary code sets (ZCCSs) in the literature has been a conjecture. In this letter, we provide detailed derivations of a conjectured bound on the set size of multiphase ZCCSs. A multiphase ZCCS is optimal when its set size reaches the upper bound. Furthermore, we propose a new construction of ZCCSs based on extended generalized Boolean functions (EGBFs). The proposed method introduces optimal ZCCSs with new parameters.",

author = "Pai, \{Cheng Yu\} and Tung, \{Yu Che\} and Huang, \{Zhen Ming\} and Chen, \{Chao Yu\}",

year = "2025",

doi = "10.1109/LSP.2025.3537996",

language = "English",

volume = "32",

pages = "1021--1025",

journal = "IEEE Signal Processing Letters",

issn = "1070-9908",

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

}

TY - JOUR

T1 - Set Size Bound for Aperiodic Z-Complementary Code Sets

AU - Pai, Cheng Yu

AU - Tung, Yu Che

AU - Huang, Zhen Ming

AU - Chen, Chao Yu

PY - 2025

Y1 - 2025

N2 - The widely and commonly adopted upper bound on the set size of aperiodic Z-complementary code sets (ZCCSs) in the literature has been a conjecture. In this letter, we provide detailed derivations of a conjectured bound on the set size of multiphase ZCCSs. A multiphase ZCCS is optimal when its set size reaches the upper bound. Furthermore, we propose a new construction of ZCCSs based on extended generalized Boolean functions (EGBFs). The proposed method introduces optimal ZCCSs with new parameters.

AB - The widely and commonly adopted upper bound on the set size of aperiodic Z-complementary code sets (ZCCSs) in the literature has been a conjecture. In this letter, we provide detailed derivations of a conjectured bound on the set size of multiphase ZCCSs. A multiphase ZCCS is optimal when its set size reaches the upper bound. Furthermore, we propose a new construction of ZCCSs based on extended generalized Boolean functions (EGBFs). The proposed method introduces optimal ZCCSs with new parameters.

UR - https://www.scopus.com/pages/publications/105001062521

UR - https://www.scopus.com/pages/publications/105001062521#tab=citedBy

U2 - 10.1109/LSP.2025.3537996

DO - 10.1109/LSP.2025.3537996

M3 - Article

AN - SCOPUS:105001062521

SN - 1070-9908

VL - 32

SP - 1021

EP - 1025

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

ER -

Set Size Bound for Aperiodic Z-Complementary Code Sets

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this