Construction of optimal binary Z-complementary code sets with new lengths using generalized Boolean function (Q6086197)

Let \(\Theta(u, v)\) denotes the aperiodic cross-correlation sum (ACCS) between the complex values sequences \(u\) and \(v\) of length \(L.\) Let \(C =\{C_0, \ldots,C_{M-1}\}\) be collection of \(M\) sequence sets. The code set \(C\) is called an \((M, N, L, Z)-\)Z-complementary code set (ZCCSs) if \(\Theta(C_{\mu_1}, C_{\mu_2})(\tau)=NL\) whenever \(\tau=0\) and \(\mu_1=\mu_2,\) and \(\Theta(C_{\mu_1}, C_{\mu_2})(\tau)=0\) otherwise. Z-complementary code sets (ZCCSs) are used in multicarrier code-division multiple access (MC-CDMA) systems. In this paper the authors propose three new constructions of optimal binary \((R2^{k+1}, 2^{k+1}, R\gamma, \gamma)-\)ZCCs, \((R2^{k+1}, 2^{k+1}, R2^{m_2} , 2^{m_2})-\)ZCCs and \((2^{k+1}, 2^{k+1},3\gamma, 2\gamma)-\)ZCCs based on generalized Boolean functions (GBFs), where \(\gamma =2^{m_1-1}+2^{m_1-3},\) \(m_1 \ge 5, k \ge 1,m_2 \ge 1\) and \(R\) is any even number. The proposed ZCCSs can be used to cover many unreported lengths and a large number of users. A comparison between the proposed constructions and those previously established by other authors for non power of two (NPT) ZCCs is presented.