| PERFECT PUNCTURED BINARY SEQUENCE PAIRS |
| |
| 作者姓名： | JiangTing ZhaoXiaoqun HouLantian |
| |
| 作者单位： | [1]InfraredFiberandSensorInstituteOfYanshanUniversity,Qinhuangdao006004 [2]InformationCollege,HebeiUniversityofTechnology,Tianjin300130 |
| |
| 基金项目： | 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.
|
| 关 键 词： | 信息理论 完全序列 编码 伪随机二元序列 |
| 收稿时间： | 11 March 2002 |
Perfect punctured binary sequence pairs |
| |
| JiangTing ZhaoXiaoqun HouLantian.PERFECT PUNCTURED BINARY SEQUENCE PAIRS[J].Journal of Electronics,2003,20(4):285-288. |
| |
| Authors: | Jiang Ting Zhao Xiaoqun Hou Lantian |
| |
| Affiliation: | 1. Infrared Fiber and Sensor Institute Of Yanshan University, Qinhuangdao 006004
2. Information College, Hebei University of Technology, Tianjin 300130 |
| |
| Abstract: | 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. |
| |
| Keywords: | Information theory Perfect sequences Codes Pseudo-random binary sequence |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
| 点击此处可从《电子科学学刊(英文版)》浏览原始摘要信息 |
|
点击此处可从《电子科学学刊(英文版)》下载全文 |
