A Direct Construction of Type-II Z Complementary Code Set with Arbitrarily Large Codes

05/02/2023

∙

by   Rajen Kumar, et al.

∙

0

∙

share

In this paper, we propose a construction of type-II Z-complementary code set (ZCCS), using a multi-variable function with Hamiltonian paths and disjoint vertices. For a type-I (K,M,Z,N)-ZCCS, K is bounded by K ≤ M ⌊N/Z⌋. However, the proposed type-II ZCCS provides K = M(N-Z+1). The proposed type-II ZCCS provides a larger number of codes compared to that of type-I ZCCS. Further, the proposed construction can generate the Kernel of complete complementary code (CCC) as (p,p,p)-CCC, for any integral value of p≥2.