Linear complexity of two classes of optimal sets frequency-hopping sequences
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 apply...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2012-02-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/1000-436X(2012)02-0175-07/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1000-436X |