Set Size Bound for Aperiodic Z-Complementary Sets
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929610595237888 |
|---|---|
| author | Pai, Cheng-Yu Tung, Yu-Che Huang, Zhen-Ming Chen, Chao-Yu |
| author_facet | Pai, Cheng-Yu Tung, Yu-Che Huang, Zhen-Ming Chen, Chao-Yu |
| contents | The widely and commonly adopted upper bound on the set size of aperiodic Z-complementary sets (ZCSs) in the literature has been a conjecture. In this letter, we provide detailed derivations for this conjectured bound. A ZCS is optimal when its set size reaches the upper bound. Furthermore, we propose a new construction of ZCSs based on extended generalized Boolean functions (EGBFs). The proposed method introduces optimal ZCSs with new parameters. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_01438 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Set Size Bound for Aperiodic Z-Complementary Sets Pai, Cheng-Yu Tung, Yu-Che Huang, Zhen-Ming Chen, Chao-Yu Information Theory The widely and commonly adopted upper bound on the set size of aperiodic Z-complementary sets (ZCSs) in the literature has been a conjecture. In this letter, we provide detailed derivations for this conjectured bound. A ZCS is optimal when its set size reaches the upper bound. Furthermore, we propose a new construction of ZCSs based on extended generalized Boolean functions (EGBFs). The proposed method introduces optimal ZCSs with new parameters. |
| title | Set Size Bound for Aperiodic Z-Complementary Sets |
| topic | Information Theory |
| url | https://arxiv.org/abs/2412.01438 |