MORE CYCLOTOMIC CONSTRUCTIONS OF OPTIMAL FREQUENCY-HOPPING SEQUENCES

被引：3
作者：
Xu, Shanding [1 ,2 ,3 ]
Cao, Xiwang [2 ,4 ]
Mi, Jiafu [2 ]
Tang, Chunming [3 ]
机构：
[1] Nanjing Inst Technol, Dept Math & Phys, Nanjing 211167, Jiangsu, Peoples R China
[2] Nanjing Univ Aeronaut & Astronaut, Dept Math, Nanjing 210016, Jiangsu, Peoples R China
[3] Guangzhou Univ, Guangdong Higher Educ Inst, Key Lab Math & Interdisciplinary Sci, Guangzhou 510006, Guangdong, Peoples R China
[4] Chinese Acad Sci, Inst Informat Engn, State Key Lab Informat Secur, Beijing 100093, Peoples R China
来源：
ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2019年 / 13卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Frequency-hopping sequence; Zeng-Cai-Tang-Yang cyclotomy; the Lempel-Greenberger bound; the Peng-Fan bound; OPTIMAL SETS; BOUNDS;
D O I：
10.3934/amc.2019024
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, some general properties of the Zeng-Cai-Tang-Yang cyclotomy are studied. As its applications, two constructions of frequency hopping sequences (FHSs) and two constructions of FHS sets are presented, where the length of sequences can be any odd integer larger than 3. The FHSs and FHS sets generated by our construction are (near-) optimal with respect to the Lempel-Greenberger bound and Peng-Fan bound, respectively. By choosing appropriate indexes and index sets, a lot of (near-) optimal FHSs and FHS sets can be obtained by our construction. Furthermore, some of them have new parameters which are not covered in the literature.
引用
收藏
页码：373 / 391
页数：19
相关论文
共 28 条
[21]   Lower bounds on the hamming auto- and cross correlations of frequency-hopping sequences [J].
Peng, DY ;
Fan, PZ .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (09) :2149-2154
[22]   New sets of frequency-hopping sequences with optimal Hamming correlation [J].
Ren, Wenli ;
Fu, Fang-Wei ;
Zhou, Zhengchun .
DESIGNS CODES AND CRYPTOGRAPHY, 2014, 72 (02) :423-434
[23]   Optimal Frequency-Hopping Sequence Sets Based on Cyclotomy [J].
Xu, Shanding ;
Cao, Xiwang ;
Xu, Guangkui .
INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2016, 27 (04) :443-462
[24]   Recursive construction of optimal frequency-hopping sequence sets [J].
Xu, Shanding ;
Cao, Xiwang ;
Xu, Guangkui .
IET COMMUNICATIONS, 2016, 10 (09) :1080-1086
[25]   New Bound on Frequency Hopping Sequence Sets and Its Optimal Constructions [J].
Yang, Yang ;
Tang, Xiaohu ;
Parampalli, Udaya ;
Peng, Daiyuan .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (11) :7605-7613
[26]   Optimal Frequency Hopping Sequences of Odd Length [J].
Zeng, Xiangyong ;
Cai, Han ;
Tang, Xiaohu ;
Yang, Yang .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (05) :3237-3248
[27]   A Class of Optimal Frequency Hopping Sequences with New Parameters [J].
Zeng, Xiangyong ;
Cai, Han ;
Tang, Xiaohu ;
Yang, Yang .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (07) :4899-4907
[28]   New Constructions for Optimal Sets of Frequency-Hopping Sequences [J].
Zhou, Zhengchun ;
Tang, Xiaohu ;
Peng, Daiyuan ;
Parampalli, Udaya .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (06) :3831-3840
123