Recently, mutually orthogonal complementary sequence sets (MOCSSs) have been found many important applications in communication systems, radar, etc. Most of the known constructions of MOCSSs are based on generalized Boolean functions (GBFs) and hence mostly have lengths of power-of-two. A few constructions of MOCSSs are also based on paraunitary (PU) matrices and hence mostly have power-of-an-integer lengths. The objective of this paper is to develop a general framework to construct more MOCSSs consisting of sequences with non-power-of-two lengths. The proposed framework is based on complete complementary codes and even-shift complementary sequence sets.

中文翻译：

---

非二次幂的互正交互补序列集的广义构造

最近，相互正交的互补序列集 (MOCSS) 在通信系统、雷达等中被发现有许多重要的应用。 MOCSS 的大多数已知结构都基于广义布尔函数 (GBF)，因此大多具有以下幂的长度：二。MOCSS 的一些构造也基于超幺正 (PU) 矩阵，因此大多具有整数幂的长度。本文的目的是开发一个通用框架来构建更多由非二次幂序列组成的 MOCSS。所提出的框架基于完整的互补代码和偶移互补序列集。