New Correlation Bound and Construction of Quasi-Complementary Code Sets
Palash Sarkar, Chunlei Li, Sudhan Majhi, and Zilong Liu

TL;DR
This paper introduces a new correlation bound for a class of quasi-complementary sequence sets and provides a systematic construction method that approaches this bound, enhancing multi-user communication systems.
Contribution
It derives a tighter aperiodic correlation lower bound for QCSSs composed of CCCs and presents a systematic construction method meeting this bound asymptotically.
Findings
Derived a new aperiodic correlation lower bound for QCSSs.
Constructed QCSSs with small alphabet size and low correlation.
Showed constructed QCSSs meet the new bound asymptotically.
Abstract
Quasi-complementary sequence sets (QCSSs) have attracted sustained research interests for simultaneously supporting more active users in multi-carrier code-division multiple-access (MC-CDMA) systems compared to complete complementary codes (CCCs). In this paper, we investigate a novel class of QCSSs composed of multiple CCCs. We derive a new aperiodic correlation lower bound for this type of QCSSs, which is tighter than the existing bounds for QCSSs. We then present a systematic construction of such QCSSs with a small alphabet size and low maximum correlation magnitude, and also show that the constructed aperiodic QCSSs can meet the newly derived bound asymptotically.
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
TopicsWireless Communication Networks Research · Advanced Wireless Communication Techniques · Coding theory and cryptography
