A New Generalized Paraunitary Generator for Complementary Sets and Complete Complementary Codes of Size 2.

Complementary sequence sets (CSSs) and complete complementary codes (CCCs) have many applications in science and engineering, especially in wireless communications. A construction of CSS and CCC, having size M = 2m and length MK, where m and K are positive integers, is presented. The proposed construction is a generalized paraunitary (PU) algorithm that greatly increases the number of permutations...