New Interleaving Constructions of Asymptotically Optimal Periodic Quasi-Complementary Sequence Sets
Gaojun Luo, Martianus Frederic Ezerman, and San Ling

TL;DR
This paper introduces new interleaving methods and direct constructions for asymptotically optimal periodic quasi-complementary sequence sets, enhancing their flexibility and practical applicability in communication systems.
Contribution
It presents a novel insight linking asymptotically optimal sequence sets to QCSS construction via interleaving, and proposes two new direct, flexible constructions without interleaving.
Findings
Seven examples of QCSSs constructed using the interleaving method.
Two new direct constructions of asymptotically optimal QCSSs with flexible parameters.
The constructions utilize group theory and finite field characters.
Abstract
The correlation properties of sequences form a focal point in the design of multiple access systems of communications. Such a system must be able to serve a number of simultaneous users while keeping interference low. A popular choice for the set of sequences to deploy is the quasi-complementary sequence set (QCSS). Its large set size enables the system to accommodate a lot of users. The set has low nontrivial correlation magnitudes within a zone around the origin. This keeps undue interference among users under control. A QCSS performs better than the perfect complementary sequence set (PCSS) does in schemes with fractional delays. The optimality of a set of periodic sequences is measured by its maximum periodic correlation magnitude, for which there is an established lower bound to aim at. For a fixed period, optimal sets are known only for very restricted parameters. Efforts have…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Cooperative Communication and Network Coding
