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 \leq M \left\lfloor \frac{N}{Z}\right\rfloor$. 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\ge2$.

翻译：本文提出了一种利用含哈密顿路径和不交顶点的多变量函数构造II型$Z$互补码集（ZCCS）的方法。对于I型$(K,M,Z,N)$-ZCCS，其码字数量$K$满足$K \leq M \left\lfloor \frac{N}{Z}\right\rfloor$。然而，所提出的II型ZCCS可实现$K = M(N-Z+1)$，相较于I型ZCCS提供了更大数量的码字。此外，该构造方法能够生成任意整数$p\ge2$下的完全互补码（CCC）的核$(p,p,p)$-CCC。