New Correlation Bound and Construction of Quasi-Complementary Code Sets

2022/04/28 by Palash Sarkar, Sarkar, Palash, Chunlei Li +5
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Electrical engineering #FOS: Mathematics #Information Theory (cs.IT) #Signal Processing (eess.SP) #Wireless Communication Networks Research #electronic engineering #information engineering

paper · pdf · doi:10.48550/arxiv.2204.13538

openalex publication_date 2022/04/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• A Generalised Construction of Multiple Complete Complementary Codes and Asymptotically Optimal Aperiodic Quasi-Complementary Sequence Sets
• New constructions of asymptotically optimal periodic and aperiodic quasi-complementary sequence sets
• New Construction of Z-Complementary Code Sets and Mutually Orthogonal Complementary Sequence Sets
• Asymptotically Optimal and Near-optimal Aperiodic Quasi-Complementary Sequence Sets Based on Florentine Rectangles
• Constructions of Optimal and Near-Optimal Quasi-Complementary Sequence Sets from an Almost Difference Set