| 一种综合E序列的快速算法 | |
| Alternative Title | A Fast Algorithem for Synthesizing E-seguences |
| 赵霆 | |
| Department | 国家863计划微波遥感技术实验室 |
| Source Publication | 电子学报
 |
| 1993 | |
| Volume | 21Issue:7Pages:107-109 |
| ISSN | 0732-2112 |
| Language | 中文 |
| Keyword | 二元序列 E序列 算法 |
| Abstract | 本文从E序列的组合性质出发,把E序列划分为“组”、“群”和“族”,证明了当序列长度大于等于8时,一“族”E序列的不重复性,进而导出了一种简洁,快速,高效的综合E序列的算法。这种算法对于需要产生大量长E序列的工程问题特别有效。 |
| Other Abstract | A kind of binary sequences called E sequences is discussed.Based on their combinatorial properties,E sequences are divided into "pack","group" and "class".It is proved that when their lengths are longer than or as long as 8,E sequences belonging to the same "class" can not be identical.Finally a brief,fast and effective algorithm for synthesizing E sequences,especially a large number of long E sequences,is derived. |
| Funding Project | 中国科学院空间科学与应用研究中心 |
| Document Type | 期刊论文 |
| Identifier | http://ir.nssc.ac.cn/handle/122/1832 |
| Collection | 微波遥感部 |
| Recommended Citation GB/T 7714 | 赵霆. 一种综合E序列的快速算法[J]. 电子学报,1993,21(7):107-109. |
| APA | 赵霆.(1993).一种综合E序列的快速算法.电子学报,21(7),107-109. |
| MLA | 赵霆."一种综合E序列的快速算法".电子学报 21.7(1993):107-109. |
| Files in This Item: | Download All | |||||
| File Name/Size | DocType | Version | Access | License | ||
| 1993217107.pdf（114KB） | 期刊论文 | 出版稿 | 开放获取 | CC BY-NC-SA | View Download | |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment