New Complete Complementary Codes and Their Analysis

A new complete complementary code set, where each code consists of arbitrary even number sequences with arbitrary length, is constructed. When the condition of auto correlation function is imperfect, a quasi-perfect complete complementary code set, where each code consists of arbitrary N sequences with arbitrary length, is presented. Subsequently, a natural extension of the quasi-perfect complete complementary code set is given. In addition, a general way to construct complete complementary code set based on solving equations is also demonstrated in this paper. Simulation results validate the correctness of all the construction methods above. A comparison between these new construction methods and Schweitzer´s one is made, it shows that the order of complete complementary code set is not restricted to 2^m and each sequence length can also be arbitrary.