New Lower Bounds on Aperiodic Hamming Correlation of Frequency Hopping Sequences

It is generally accepted that aperiodic Hamming correlation of frequency hopping sequences (FHSs) matters especially in practical communication applications. In this paper, new lower bounds of FHS sets on AHC is proposed. Then the performance of our new bounds are compared with some existing lower bounds both by theoretical deduction and simulation. Results show that our new bounds make an effective improvement on the previous bounds.

Authors

Institutions

Publication Details

Published
2024-08-16
DOI
https://doi.org/10.1109/icait62580.2024.10808017
Citations
1
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.35

Funders

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

New Lower Bounds on Aperiodic Hamming Correlation of Frequency Hopping Sequences

Zhe Xu, Yongfei Bai, Kaichuang Jiang, S. Yang
1 citations
Coding theory and cryptography
0.35
article

New Lower Bounds on Aperiodic Hamming Correlation of Frequency Hopping Sequences

Zhe Xu, Yongfei Bai, Kaichuang Jiang, S. Yang
article en
1 citations

Abstract

It is generally accepted that aperiodic Hamming correlation of frequency hopping sequences (FHSs) matters especially in practical communication applications. In this paper, new lower bounds of FHS sets on AHC is proposed. Then the performance of our new bounds are compared with some existing lower bounds both by theoretical deduction and simulation. Results show that our new bounds make an effective improvement on the previous bounds.

Xidian University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 30%
Coding theory and cryptography
0.35
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.