PERFECT PUNCTURED BINARY SEQUENCE PAIRS  

作　　者：JiangTing ZhaoXiaoqun HouLantian 

机构地区：[1]InfraredFiberandSensorInstituteOfYanshanUniversity,Qinhuangdao006004 [2]InformationCollege,HebeiUniversityofTechnology,Tianjin300130

出　　处：《Journal of Electronics(China)》2003年第4期285-288,共4页电子科学学刊（英文版）

基　　金：Supported by the National Natural Science Foundation of China under Grant 69972042

摘　　要：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 verifies that the pseudo-random binary sequences with length up to N=127 can be easily turned into perfect punctured binary sequence pairs.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.

关 键 词：Information theory Perfect sequences CODES Pseudo-random binary sequence 

分 类 号：TN911.2[电子电信—通信与信息系统]