A construction method of binary complementary sequence pair set was proposed with theoretical proof.
提出了一种二元互补序列偶集的构造方法，并给出了相应的理论证明。
Time complexity and space complexity in searching binary complementary sequence pair are very huge because four sequences are involved in the calculation.
因为对二元互补序列偶的搜索涉及到四个序列的计算，搜索的时间复杂度和空间复杂度很大。
Generalized pseudorandom punctured binary sequence pair along with the transformation properties and combinatorial limited conditions are presented.
提出了广义伪随机屏蔽二进序列偶，给出了其变换性质、组合允许条件。
应用推荐