Two Constructions of Asymptotically Optimal Quasi-Complementary Sequence Sets

Abstract

An $(M,K,N,\delta _{\mathrm {max}})$ -quasi-complementary sequence set (QCSS) is referred to as a set of $M$ two-dimensional matrices of size $K\times N$ with maximum periodic correlation magnitude $\delta _{\mathrm {max}}$ . It can be applied to a multi-carrier code-division multiple-access communication system to achieve low-interference performance. Compared with perfect complementary sequence sets, QCSSs with maximum periodic correlation magnitudes achieving or asymptotically achieving the correlation lower bounds have the advantage of supporting more users. In this paper, two constructions of periodic QCSSs from additive characters and multiplicative characters of finite fields are developed. In the first construction, new QCSSs with constituent sequence length $N=p$ are proposed by using cyclic classes, where $p$ is a prime. In the second construction, QCSSs with constituent sequence length $N=q-1$ and $N=r^{2}-1$ are presented by employing almost difference sets and special sets proposed by Katz, respectively, where $q>5$ is an odd prime power and $r$ is a prime power. Notably, the parameters of QCSSs derived from the second construction are flexible and have not been covered in the literature. In addition, all the proposed periodic QCSSs are asymptotically optimal with respect to the correlation lower bounds.