A Direct Construction of GCP and Binary CCC of Length Non Power of Two

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.