A special class of difference set pairs is equal to the perfect binary arrays pairs.
差集偶是一类新的组合设计，一类特殊的差集偶与最佳二进阵列偶是等价的。
These properties can be regarded as the construction methods of generalized relative difference set pairs.
这些性质也可以看作是广义相对差集偶的构造方法。
By using these construction methods, the new generalized relative difference set pairs can be constructed from the known generalized relative difference set pairs.
应用这些构造方法可以从已知的广义相对差集偶构造出新的广义相对差集偶。
In this paper we introduce special morphisms on difference sets and we prove that the quotient of the equivalence classes defined by special morphisms is a difference set.
在差分集中引入了特殊态射，证明了由特殊态射定义的等价类所作成的商还是差分集。
The conception "almost perfect arrays" is proposed and it is shown that the existence of an almost perfect binary array is equivalent to the existence of a certain divisible difference set.
研究了密码中的拟完美序列和完美序列与循环差集的关系，用群表示论证明了三族循环差集的存在；进而构造出相应的拟完美序列。
The conception "almost perfect arrays" is proposed and it is shown that the existence of an almost perfect binary array is equivalent to the existence of a certain divisible difference set.
研究了密码中的拟完美序列和完美序列与循环差集的关系，用群表示论证明了三族循环差集的存在；进而构造出相应的拟完美序列。
应用推荐