English
Related papers

Related papers: Frequency hopping sequences with optimal partial H…

200 papers

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…

Information Theory · Computer Science 2016-10-13 Jingjun Bao

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…

Information Theory · Computer Science 2011-08-18 Jin-Ho Chung , Kyeongcheol Yang

Frequency-hopping sequences (FHSs) with low Hamming correlation and wide gaps significantly contribute to the anti-interference performance in FH communication systems. This paper investigates FHSs with optimal Hamming correlation and…

Information Theory · Computer Science 2025-06-03 Chen Li , Chunlei Li , Xiangyong Zeng , Dian Li

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…

Information Theory · Computer Science 2019-05-14 Yi Ouyang , Xianhong Xie , Honggang Hu , Ming Mao

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…

Information Theory · Computer Science 2015-06-25 Jingjun Bao , Lijun Ji

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…

Information Theory · Computer Science 2010-09-21 Fang Liu , Daiyuan Peng , Zhengchun Zhou , Xiaohu Tang

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…

Information Theory · Computer Science 2018-12-24 Xianhua Niu , Chaoping Xing

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…

Information Theory · Computer Science 2018-06-27 Xianhua Niu , Chaoping Xing

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…

Signal Processing · Electrical Eng. & Systems 2024-08-23 M Kavi Priya , K Giridhar

The study of frequency-hopping sequences (FHSs) has been focused on the establishment of theoretical bounds for the parameters of FHSs as well as on the construction of optimal FHSs with respect to the bounds. Peng and Fan (2004) derived…

Information Theory · Computer Science 2016-05-12 Bocong Chen , Liren Lin , San Ling , Hongwei Liu

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…

Cryptography and Security · Computer Science 2017-06-15 Minglong Qi , Shenwu Xiong , Jingling Yuan

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,…

Information Theory · Computer Science 2016-11-17 Yeow Meng Chee , Alan C. H. Ling , Jianxing Yin

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…

Information Theory · Computer Science 2018-07-27 Mwawi M. Nyirenda , Siaw-Lynn Ng , Keith M. Martin

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…

Machine Learning · Computer Science 2025-03-07 Inkyu Kim , Sangkeum Lee , Haechan Jeong , Sarvar Hussain Nengroo , Dongsoo Har

We present a new family of one-coincidence sequence sets suitable for frequency hopping code division multiple access (FH-CDMA) systems with dispersed (low density) sequence elements. These sets are derived from one-coincidence prime…

Information Theory · Computer Science 2017-12-11 Lenny Fukshansky , Ahmad Adib Shaar

Sets of sequences with good correlation properties are desired in many active sensing and communication systems, e.g., multiple-input-multiple-output (MIMO) radar systems and code-division multiple-access (CDMA) cellular systems. In this…

Optimization and Control · Mathematics 2016-05-04 Junxiao Song , Prabhu Babu , Daniel P. Palomar

In this paper, a multi-user multi-hop hybrid FSO / RF system is presented. This structure is consisted of two main parts. The main motivation of presenting this structure is communication in long-range impassable links or some specific…

Signal Processing · Electrical Eng. & Systems 2018-11-21 Mohammad Ali Amirabadi

Coded caching is a promising technique to effectively reduce peak traffic by using local caches and the multicast gains generated by these local caches. We prefer to design a coded caching scheme with the subpacketization $F$ and…

Information Theory · Computer Science 2025-02-25 Minquan Cheng , Huimei Wei , Kai Wan , Giuseppe Caire

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…

Information Theory · Computer Science 2010-04-28 Kenneth W. Shum , Wing Shing Wong

The paper introduces final state identification (synchronizing and homing) sequences for Timed Finite State Machines (TFSMs) with output delays and investigates their properties. We formally define the notions of homing sequences (HSs) and…

Formal Languages and Automata Theory · Computer Science 2025-10-08 Evgenii Vinarskii , Jakub Ruszil , Adam Roman , Natalia Kushik
‹ Prev 1 2 3 10 Next ›