This paper presents the definition of perfect punctured binary sequence pair and the combinatorial admissible conditions for searching the perfect punctured binary sequence pairs and proves that all of the pseudo-random binary sequences satisfy these conditions. Computer calculation verifes that the pseudo-random binary sequences with length up to N=127 can be easily turned into perfect punctured binary sequence pairs.
展开▼