论文标题
直接构建具有零相关区属性的完整互补代码，用于质量长度
A Direct Construction of Complete Complementary Code with Zero Correlation Zone property for Prime-Power Length
论文作者
论文摘要
在本文中，我们提出了一种新型代码集的直接构造，该集合结合了完整的互补代码（CCC）和零相关区（ZCZ）序列的属性，并将其称为“完整互补”（CC-ZCZ）代码集。代码集是通过使用多变量函数构建的。拟议的结构还为Golay-ZCZ代码提供了新的长度，即Prime Power长度。所提出的Golay-ZCZ代码分别通过\ emph {tang-fan-matsufuzi}结合了二进制和非二进制案例的最佳和渐近最佳。此外，拟议的直接结构提供了长度$ p^k $的新颖ZCZ序列，其中$ k $是整数$ \ geq 2 $。我们建立了所提出的CC-ZCZ代码集与一阶广义芦苇毛器（GRM）代码之间的关系，并证明两者均具有相同的锤距。我们还计算了一阶GRM代码中设置的CC-ZCZ代码的数量。提出的CC-ZCZ构造的列序列峰值与均值的包络功率比（PMEPR）与现有作品进行了比较。拟议的构造也被推论为Golay-ZCZ和ZCZ序列，这些序列与现有工作进行了比较。拟议的建筑概括了许多现有工作。
In this paper, we propose a direct construction of a novel type of code set, which has combined properties of complete complementary code (CCC) and zero-correlation zone (ZCZ) sequences and called it complete complementary-ZCZ (CC-ZCZ) code set. The code set is constructed by using multivariable functions. The proposed construction also provides Golay-ZCZ codes with new lengths, i.e., prime-power lengths. The proposed Golay-ZCZ codes are optimal and asymptotically optimal for binary and non-binary cases, respectively, by \emph{Tang-Fan-Matsufuzi} bound. Furthermore, the proposed direct construction provides novel ZCZ sequences of length $p^k$, where $k$ is an integer $\geq 2$. We establish a relationship between the proposed CC-ZCZ code set and the first-order generalized Reed-Muller (GRM) code, and proved that both have the same Hamming distance. We also counted the number of CC-ZCZ code set in first-order GRM codes. The column sequence peak-to-mean envelope power ratio (PMEPR) of the proposed CC-ZCZ construction is derived and compared with existing works. The proposed construction is also deduced to Golay-ZCZ and ZCZ sequences which are compared to the existing work. The proposed construction generalizes many of the existing work.
