New Families of Frequency-Hopping Sequence Sets with Optimal Hamming Correlation

With the advantage of transmitting messages efficiently along with switching frequencies at set intervals by each user, frequency-hopping sequence (FHS) has been widely applied in the frequency-hopping multiple access spread spectrum systems. In such systems, the Hamming correlation property of FHS is an important standard to measure the system performance. In this paper, a combinatorial description of difference-balanced function from [Formula: see text] onto [Formula: see text] is given, and the sizes of its preimage sets are determined without resorting to d-homogeneous property, where m and n are two positive integers with [Formula: see text]. Afterwards, we construct new near-optimal FHSs and optimal FHS sets by virtue of the Chinese Remainder Theorem and d-homogeneous functions with difference-balanced property, which generalize some earlier constructions of optimal FHS sets and produce optimal FHS sets which are not covered in the foregoing literature.

Authors

Institutions

Publication Details

Journal
International Journal of Foundations of Computer Science
Published
2025-01-29
DOI
https://doi.org/10.1142/s0129054125500017
Primary Topic
Wireless Communication Networks Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

New Families of Frequency-Hopping Sequence Sets with Optimal Hamming Correlation

Shanding Xu
International Journal of Foundations of Computer Science
Wireless Communication Networks Research
article

New Families of Frequency-Hopping Sequence Sets with Optimal Hamming Correlation

Shanding Xu
article en

Abstract

With the advantage of transmitting messages efficiently along with switching frequencies at set intervals by each user, frequency-hopping sequence (FHS) has been widely applied in the frequency-hopping multiple access spread spectrum systems. In such systems, the Hamming correlation property of FHS is an important standard to measure the system performance. In this paper, a combinatorial description of difference-balanced function from [Formula: see text] onto [Formula: see text] is given, and the sizes of its preimage sets are determined without resorting to d-homogeneous property, where m and n are two positive integers with [Formula: see text]. Afterwards, we construct new near-optimal FHSs and optimal FHS sets by virtue of the Chinese Remainder Theorem and d-homogeneous functions with difference-balanced property, which generalize some earlier constructions of optimal FHS sets and produce optimal FHS sets which are not covered in the foregoing literature.

International Journal of Foundations of Computer ScienceVol. 36(06)
Nanjing Institute of Technology (CN), Putian University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 99%
Wireless Communication Networks Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

New Families of Frequency-Hopping Sequence Sets with Optimal Hamming Correlation — Shanding Xu · International Journal of Foundations of Computer Science (2025) | TGRS Research Map | TGRS