Construction of Optimal Binary Z-Complementary Code Sets with New Lengths

2023/01/09 by Gobinda Ghosh, Ghosh, Gobinda, Sudhan Majhi +3
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Networks Research

paper · pdf · doi:10.48550/arxiv.2301.03294

openalex publication_date 2023/01/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems, for interference-free communication over multiuser and quasi-asynchronous environments. In this letter, we propose three new constructions of optimal binary (R2^k+1,2^k+1, Rγ,γ)-ZCCS, (R2^k+1,2^k+1, R2^m₂,2^m₂)-ZCCS and (2^k+1,2^k+1,3γ,2γ)-ZCCS based on generalized Boolean functions (GBFs), where γ=2^m₁-1+2^m₁-3, m₁≥ 5, k≥ 1,m₂≥ 1 and R is any even number. The proposed ZCCSs cover many unreported lengths and large set sizes.

Related

• Pseudo-Boolean Functions for Optimal Z-Complementary Code Sets with Flexible Lengths
• New Constructions of Mutually Orthogonal Complementary Sets and Z-Complementary Code Sets Based on Extended Boolean Functions
• New Construction of Z-Complementary Code Sets and Mutually Orthogonal Complementary Sequence Sets
• Construction of CCC and ZCCS Through Additive Characters Over Galois Field
• Optimal Z-complementary Code Set From Generalized Reed-Muller Codes