Pseudo-Boolean Functions for Optimal Z-Complementary Code Sets with Flexible Lengths
Information Theory
2021-04-21 v1 Signal Processing
math.IT
Abstract
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.
Keywords
Cite
@article{arxiv.2104.10062,
title = {Pseudo-Boolean Functions for Optimal Z-Complementary Code Sets with Flexible Lengths},
author = {Palash Sarkar and Sudhan Majhi and Zilong Liu},
journal= {arXiv preprint arXiv:2104.10062},
year = {2021}
}