Related papers: Constructions of Optimal Frequency-Hopping Sequenc…
Frequency hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. In this paper, we investigate constructions of FHSs and FHS sets with…
In frequency-hopping multiple-access (FHMA) systems, the average Hamming correlation (AHC) among frequency-hopping sequences (FHSs) as well as the maximum Hamming correlation (MHC) is an important performance measure. Therefore, it is a…
Collision-free Frequency Hopping Sequences (FHS) are crucial for maintaining the throughput of Frequency Hopping Multiple Access (FHMA) communication systems. When multiple FHS deployed in the same geographical area hop into the same…
Frequency hopping (FH) sequences play a key role in frequency hopping spread spectrum communication systems. It is important to find FH sequences which have simultaneously good Hamming correlation, large family size and large period. In…
In this paper, we construct three classes of strictly optimal frequency-hopping sequence (FHS) sets with respect to partial Hamming correlation and family size. The first class is based on a generic construction, the second and third…
Frequency hopping sequences (FHSs) are employed to mitigate the interferences caused by the hits of frequencies in frequency hopping spread spectrum systems. In this paper, we present some new algebraic and combinatorial constructions for…
In this paper, a new class of frequency hopping sequences (FHSs) of length $ p^{n} $ is constructed by using Ding-Helleseth generalized cyclotomic classes of order 2, of which the Hamming auto- and cross-correlation functions are…
Frequency hopping sequences (FHSs) with favorable partial Hamming correlation properties have important applications in many synchronization and multiple-access systems. In this paper, we investigate constructions of FHS sets with optimal…
In literatures, there are various constructions of frequency hopping sequence (FHS for short) sets with good Hamming correlations. Some papers employed only multiplicative groups of finite fields to construct FHS sets, while other papers…
In this paper, a general framework of constructing optimal frequency hopping sequence (FHS) sets is presented based on the designated direct product. Under the framework, we obtain infinitely many new optimal FHS sets by combining a family…
In a frequency hopping (FH) scheme users communicate simultaneously using FH sequences defined on the same set of frequency channels. An FH sequence specifies the frequency channel to be used as communication progresses. Much of the…
Satellite communication systems (SCSs) used for tactical purposes require robust security and anti-jamming capabilities, making frequency hopping (FH) a powerful option. However, the current FH systems face challenges due to significant…
The capacity of wireless networks is fundamentally limited by interference. However, little research has focused on the interference correlation, which may greatly increase the local delay (namely the number of time slots required for a…
In this paper we investigate the optimal latency of communications. Focusing on fixed rate communication without any feedback channel, this paper encompasses low-latency strategies with which one hop and multi-hop communication issues are…
Protocol sequences are used in channel access for the multiple-access collision channel without feedback. A new construction of protocol sequences with a guarantee of worst-case system throughput is proposed. The construction is based on…
The shortest-path distance is a fundamental concept in graph analytics and has been extensively studied in the literature. In many real-world applications, quality constraints are naturally associated with edges in the graphs and finding…
Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, based on almost difference sets and cyclic difference matrices,…
This paper proposes a methodology for optimizing a frequency-hopping network that uses continuous-phase frequency-shift keying and adaptive capacity-approaching channel coding. The optimization takes into account the spatial distribution of…
We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…
Frequency hopping (FH) has been widely used as a powerful technique for antijamming in wireless communications. However, as the wireless spectrum is becoming more and more crowded, it is very difficult to achieve efficient antijamming…