Set Size Bound for Aperiodic Z-Complementary Code Sets

doi:10.1109/LSP.2025.3537996

Set Size Bound for Aperiodic Z-Complementary Code Sets

2025-01-01

0

PRE

AI

DOI：10.1109/LSP.2025.3537996

Original

Original request for help

Save

Abstract

En 中文

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.

Keywords:

Upper bound

Codes

Vectors

Training

Peak to average power ratio

Electronic mail

Data mining

Boolean functions

Autocorrelation

Artificial intelligence

Conjectured bound

extended generalized Boolean functions (EGBF)

set size upper bound

Z-complementary code set (ZCCS)

Set Size Bound for Aperiodic Z-Complementary Code Sets

Abstract

Journal

Organization