Institutional Repository
| 两类最优跳频序列集的线性复杂度 | |
| Alternative Title | linear complexity of two classes of optimal sets frequency-hopping sequences |
| 高军涛; 胡予濮; 李雪莲; 向上荣 | |
| 2012 | |
| Source | 通信学报
 |
| ISSN | 1000-436X |
| Volume | 33Issue:2Pages:175-181 |
| English Abstract | 利用有限域中的一类不同于幂置换的置换多项式,将两类具有低线性复杂度的跳频序列集变换为具有高线性复杂度的最优跳频序列集.通过理论证明给出了变换以后序列线性复杂度的精确值.所得到的两类新的跳频序列集不仅具有最优的Hamming相关值,而且相对于变换前的序列集具有大的线性复杂度,可以抵抗Berlekamp-Massey算法的攻击. |
| Abstract | By using a type of permutation polynomials which were different from power permutations, the two classes of frequency-hopping sequence sets with low linear complexity was transformed into the ones with high linear complexity. The exact values of linear complexity of these sequences were given by applying the theoretical proof. The results show that the two new classes of frequency-hopping sequences sets not only have optimal Hamming correlation, but also have larger linear span and can resist the Berlekamp-Massey attack compared with the two primary classes of frequency- hopping sequence sets. |
| Keyword | Set Theory |
| Department | 西安电子科技大学计算机网络与信息安全教育部重点实验室,陕西西安710071;中国科学院软件研究所信息安全国家重点实验室,北京100190 西安电子科技大学计算机网络与信息安全教育部重点实验室,陕西西安,710071 西安电子科技大学应用数学系,陕西西安,710071 西安电子科技大学计算机学院,陕西西安,710071 |
| Language | 中文 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/14646 |
| Collection | 信息安全国家重点实验室 |
| Recommended Citation GB/T 7714 | 高军涛,胡予濮,李雪莲,等. 两类最优跳频序列集的线性复杂度[J]. 通信学报,2012,33(2):175-181. |
| APA | 高军涛,胡予濮,李雪莲,&向上荣.(2012).两类最优跳频序列集的线性复杂度.通信学报,33(2),175-181. |
| MLA | 高军涛,et al."两类最优跳频序列集的线性复杂度".通信学报 33.2(2012):175-181. |
| Files in This Item: | ||||||
| File Name/Size | DocType | Version | Access | License | ||
| 两类最优跳频序列集的线性复杂度.pdf（700KB） | 开放获取 | License | Application Full Text | |||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment