具有灵活长度的优化Z-补充代码集的优度- Boolean 函数 (Pseudo-Boolean Functions for Optimal Z-Complementary Code Sets with Flexible Lengths)

This paper aims to construct optimal Z-complementary code set (ZCCS) with non-power-of-two (NPT) lengths to enable interference-free multicarrier code-division multiple access (MC-CDMA) systems. The existing ZCCSs with NPT lengths, which are constructed from generalized Boolean functions (GBFs), are sub-optimal only with respect to the set size upper bound. For the first time in the literature, we advocate the use of pseudo-Boolean functions (PBFs) (each of which transforms a number of binary variables to a real number as a natural generalization of GBF) for direct constructions of optimal ZCCSs with NPT lengths.

翻译：本文旨在建立最佳Z-补充代码集(ZCCS),其长度为非2(《不扩散条约》)功率(ZCCS),以便能够建立无干扰的多载代码多功能访问(MC-CDMA)系统。现有的带有《不扩散条约》功率的ZCS,其长度是根据普遍的布林功能(GBFs)构建的,仅与设定的上限尺寸相比是次优的。在文献中,我们首次提倡使用假Boolean函数(其中每一种将一些二进制变量转化为实际数字,作为GBF的自然概括),直接构建具有《不扩散条约》长度的最佳ZCS。