Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T01:42:19.028Z Has data issue: false hasContentIssue false

Linear spans of optimal sets of frequency hopping sequences∗

Published online by Cambridge University Press:  23 February 2012

Gao Juntao
Affiliation:
Key Laboratory of Computer Networks and Information Security, Xidian University, Xi’an, Shaanxi province 710071, P.R. China. gjtalbert@163.comState Key Laboratory of Information Security, Graduate University of Chinese Academy of Sciences, 100049, P.R. China
Hu Yupu
Affiliation:
School of Telecommunication and Engineering of Xidian University, Xi’an, Shaanxi province 710071, P.R. China
Li Xuelian
Affiliation:
Department of Applied Mathematics of Xidian University, Xi’an, Shaanxi province 710071, P.R. China

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 δ(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.

Information

Type
Research Article
Copyright
© EDP Sciences 2012