which can be called as pseudorandom punctured binary array pairs.The transform properties
Fourier spectrum characters and combinatorial admissibility conditions of the pseudorandom punctured binary array pairs are studied.By making use of these properties and conditions
the efficiency of searching the pseudorandom punctured binary array pairs can be improved significantly.As a computational illustration
a set of pseudorandom punctured binary array pairs are given.The searching results show that the existent range of pseudorandom punctured binary array pairs is so wide that they are suitable for engineering applications.