LINEAR SPANS OF OPTIMAL SETS OF FREQUENCY HOPPING SEQUENCES

被引：0
作者：
Gao Juntao [1 ,2 ]
Hu Yupu [3 ]
Li Xuelian [4 ]
机构：
[1] Xidian Univ, Key Lab Comp Networks & Informat Secur, Xian 710071, Shaanxi Provinc, Peoples R China
[2] Chinese Acad Sci, State Key Lab Informat Secur, Beijing 100049, Peoples R China
[3] Xidian Univ, Sch Telecommun & Engn, Xian 710071, Shaanxi Provinc, Peoples R China
[4] Xidian Univ, Dept Appl Math, Xian 710071, Shaanxi Provinc, Peoples R China
来源：
RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS | 2012年 / 46卷 / 03期
关键词：
Frequency hopping sequences; linear span; permutation polynomials; optimal sets; CONSTRUCTIONS; BOUNDS;
D O I：
10.1051/ita/2012007
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Frequency hopping sequences sets are required in frequency hopping code division multiple access systems. For the anti-jamming purpose, frequency hopping sequences are required to have a large linear span. In this paper, by using a permutation polynomial delta(x) over a finite field, we transform several optimal sets of frequency hopping sequences with small linear span into ones with large linear span. The exact values of the linear span are presented by using the methods of counting the terms of the sequences representations. The results show that the transformed frequency hopping sequences are optimal with respect to the Peng-Fan bound, and can resist the analysis of Berlekamp-Massey algorithm.
引用
收藏
页码：343 / 354
页数：12
相关论文
共 19 条
  • [1] [Anonymous], 2005, SIGNAL DESIGN GOOD C, DOI DOI 10.1017/CBO9780511546907
  • [2] COMPLEX SEQUENCES OVER GF(PM) WITH A 2-LEVEL AUTOCORRELATION FUNCTION AND A LARGE LINEAR SPAN
    ANTWEILER, M
    BOMER, L
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1992, 38 (01) : 120 - 130
  • [3] Optimal frequency-hopping sequences via cyclotomy
    Chu, WS
    Colbourn, CJ
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (03) : 1139 - 1141
  • [4] Sets of optimal frequency-hopping sequences
    Ding, Cunsheng
    Yin, Jianxing
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (08) : 3741 - 3745
  • [5] Algebraic constructions of optimal frequency-hopping sequences
    Ding, Cunsheng
    Moisio, Marko J.
    Yuan, Jin
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (07) : 2606 - 2610
  • [6] Optimal Sets of Frequency Hopping Sequences From Linear Cyclic Codes
    Ding, Cunsheng
    Yang, Yang
    Tang, Xiaohu
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (07) : 3605 - 3612
  • [7] Sets of Frequency Hopping Sequences: Bounds and Optimal Constructions
    Ding, Cunsheng
    Fuji-Hara, Ryoh
    Fujiwara, Yuichiro
    Jimbo, Masakazu
    Mishima, Miwako
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (07) : 3297 - 3304
  • [8] Optimal frequency hopping sequences: A combinatorial approach
    Fuji-Hara, R
    Miao, Y
    Mishima, M
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (10) : 2408 - 2420
  • [9] Further combinatorial constructions for optimal frequency-hopping sequences
    Ge, Gennian
    Fuji-Hara, Ryoh
    Miao, Ying
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (08) : 1699 - 1718
  • [10] Optimal Frequency Hopping Sequences: Auto- and Cross-Correlation Properties
    Ge, Gennian
    Miao, Ying
    Yao, Zhongxiang
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (02) : 867 - 879
12