NEW OPTIMAL FREQUENCY HOPPING SEQUENCE SETS FROM BALANCED NESTED DIFFERENCE PACKINGS OF PARTITION-TYPE-Reference-Cited by-同舟云学术

NEW OPTIMAL FREQUENCY HOPPING SEQUENCE SETS FROM BALANCED NESTED DIFFERENCE PACKINGS OF PARTITION-TYPE

Published:2013-06 Issue:04 Volume:24 Page:533-545
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

CAI HAN¹,ZENG XIANGYONG¹,TANG XIAOHU²,HU LEI³

Affiliation:

1. Faculty of Mathematics and Computer Science, Hubei University, Wuhan 430062, P. R. China

2. Provincial Key Laboratory of Information Coding and Transmission, Institute of Mobile Communications, Southwest Jiaotong University Chengdu 610031, P. R. China

3. State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, Beijing 100195, P. R. China

Abstract

In this paper, we construct a new kind of balanced nested difference packings of partition-type based on generalized cyclotomy with respect to ℤpm. As an application, we propose a construction of frequency hopping sequence sets. The frequency hopping sequence sets obtained in this paper are optimal with respect to the Peng-Fan bound.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054113500196

Reference19 articles.

1. Whitemanʼs generalized cyclotomic numbers with respect to t primes

2. Optimal Frequency-Hopping Sequences Via Cyclotomy

3. New Classes of Optimal Frequency-Hopping Sequences by Interleaving Techniques

4. New Generalized Cyclotomy and Its Applications

5. Algebraic Constructions of Optimal Frequency-Hopping Sequences

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Optimal Frequency-Hopping Sequence Sets Based on Cyclotomy;International Journal of Foundations of Computer Science;2016-06