Construction of Complete Complementary Codes over Small Alphabet

2021/02/21 by Palash Sarkar, Sarkar, Palash, Chunlei Li +5
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2102.10517

openalex publication_date 2021/02/21 · openalex created_date 2024/03/26 · openalex updated_date 2026/07/28

Abstract

Complete complementary codes (CCCs) play a vital role not only in wireless communication, particularly in multicarrier systems where achieving an interference-free environment is of paramount importance, but also in the construction of other codes that necessitate appropriate functions to meet the diverse demands within today's landscape of wireless communication evaluation. This research is focused on the area of constructing q-ary functions for both of traditional and spectrally null constraint (SNC) CCCs\footnoteWhen no codes in CCCs having zero components, we call it as traditonal CCCs, else, we call it as SNC-CCCs in this pape. of flexible length, set size and alphabet. We construct traditional CCCs with lengths, defined as L = ∏_i=1^k p_i^m_i, set sizes, defined as K = ∏_i=1^k p_i^n_i+1, and an alphabet size of q=∏_i=1^k p_i, such that p₁

Related

• Multiple Spectrally Null Constrained Complete Complementary Codes of Various Lengths Over Small Alphabet
• Construction of CCC and ZCCS Through Additive Characters Over Galois Field
• New Construction of Z-Complementary Code Sets and Mutually Orthogonal Complementary Sequence Sets
• A Systematic Framework for the Construction of Optimal Complete Complementary Codes
• A Further Investigation on Complete Complementary Codes from q-ary Functions