arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2110.10367cs.ITmath.IT
收藏

完全差分矩阵与完全差分族的构造及应用

Constructions and Applications of Perfect Difference Matrices and Perfect Difference Families

Xianwei Sun, Huangsheng Yu, Dianhua Wu

摘要:

完全差分族(Perfect Difference Families,简称PDF)在理论和应用上都具有重要意义。完全差分矩阵及其等价结构已被广泛研究并用于构造完全差分族、雷达阵列及相关编码。PDM $(n,m)$存在的必要条件是$m\equiv 1\pmod2$和$m\geq n+1$。到目前为止,除了$m=9,11$的两个明确的例外之外,对于奇数$5\leq m\leq 201$存在PDM $(3,m)$。本文研究了$(3,m)$ s上新的递归构造,证明了对于任何奇数$5\leq m<1000$,除了$m=9,11$和$33$两个确定的例外,都存在PDMDMATHABMP s.得到了块大小比$4$不小于$\frac{1}{14}$的$(g,\{3,4\},1)$ -PDF的完整结果。作为应用,得到了一类完备的具有$3$和$4$权值的完美严格光正交码。

英文摘要:

Perfect difference families (PDFs for short) are important both in theoretical and in applications. Perfect difference matrices (PDMs for short) and the equivalent structure had been extensively studied and used to construct perfect difference families, radar array and related codes. The necessary condition for the existence of a PDM$(n,m)$ is $m\equiv 1\pmod2$ and $m\geq n+1$. So far, PDM$(3,m)$s exist for odd $5\leq m\leq 201$ with two definite exceptions of $m=9,11$. In this paper, new recursive constructions on PDM$(3,m)$s are investigated, and it is proved that there exist PDM$(3,m)$s for any odd $5\leq m<1000$ with two definite exceptions of $m=9,11$ and $33$ possible exceptions. A complete result of $(g,\{3,4\},1)$-PDFs with the ratio of block size $4$ no less than $\frac{1}{14}$ is obtained. As an application, a complete class of perfect strict optical orthogonal codes with weights $3$ and $4$ is obtained.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑