双准最佳二进阵列偶搜索算法的研究

Research ON Searching Algorithm of Doubly Quasi-perfect Binary Array Pairs

本文在研究双准最佳二进阵列偶理论的基础上,充分利用了双准最佳二进阵列偶的性质,并给出了计算机搜索双准最佳二进阵列偶的算法,并利用该搜索算法搜索出了部分小体积的双准最佳二进阵列偶。

The searching algorithm of the doubly quasi-perfect binary array pairs is presented,which is based on the theory of the doubly quasi-perfect binary array pairs,using the transform properties.Finally some doubly quasi-perfect binary array pairs with small size are listed by computer searching.