This paper presents a direct construction of Golay complementary pairs (GCPs) and binary complete complementary codes (CCCs) of non power of two lengths. CCCs have found wide range of practical applications including coding, signal processing and wireless communication due to their zero auto and cross-correlation sum properties. It is the first time GCPs of non power of two lengths are constructed using generalised Boolean functions (GBFs). We have truncated the tail of the sequence in generating non power of two length sequences. The idea is further extended to generate complementary sets (CSs). Finally, binary CCCs are constructed using CSs and its mate. To the best of authors' knowledge the direct construction of GCPs and binary CCCs of non power of two length doesn't exist in literature. We have also investigated the row and column sequence peak to mean envelope power ratio (PMEPR) of the generated sequences.

中文翻译：

---

GCP 和长度非 2 次幂的二进制 CCC 的直接构造

本文介绍了 Golay 互补对 (GCP) 和非两个长度的幂的二进制完全互补码 (CCC) 的直接构造。由于 CCC 的零自相关和互相关和特性，CCC 已经发现了广泛的实际应用，包括编码、信号处理和无线通信。这是第一次使用广义布尔函数 (GBF) 构建非二次幂的 GCP。我们在生成两个长度序列的非幂时截断了序列的尾部。这个想法进一步扩展到生成互补集（CS）。最后，使用 CS 及其伴侣构建二元 CCC。据作者所知，文献中不存在 GCP 和非二次幂的二进制 CCC 的直接构造。