Constructions of Quasi-Complementary Sequence Sets Associated With Characters

An (M; K; N; δmax)-quasi-complementary sequence set (QCSS) is referred to as a set of M two-dimensional matrices of order K × N with periodic tolerance δmax. In a multicarrier codedivision multiple-access (MC-CDMA) communication system, the set size M of a QCSS is equal to the maximum number of users it can support and the periodic tolerance δmax determines the interference performance. For the application of a QCSS, it is desirable that the set size should be as large as possible and the periodic tolerance should be as small as possible. In this paper, a framework of a periodic QCSS is proposed from additive and multiplicative characters associated with a specific integer set. It is then discovered that the parameters of the obtained QCSS are determined by the employed integer set. From this discovery, new classes of periodic QCSSs with large set sizes and low periodic tolerances are constructed associated with some known integer sets.