New extension constructions of optimal frequency hopping sequence sets
Xianhua Niu, Chaoping Xing

TL;DR
This paper introduces a flexible framework for constructing optimal frequency hopping sequence sets that overcomes previous constraints, enabling more adaptable designs for frequency-hopping spread spectrum systems.
Contribution
It presents a new extension construction method for optimal FHS sets that removes the co-primality constraint, allowing for greater parameter flexibility.
Findings
Constructed infinitely many new optimal FHS sets.
Removed the co-primality constraint in extension methods.
Enhanced parameter flexibility for FHS set design.
Abstract
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 of sequences that are newly constructed in this paper with some known optimal FHS sets. Our constructions of optimal FHS sets are also based on extension method. However, our constructions remove the constraint requiring that the extension factor is co-prime with the length of original FHSs and get new parameters. In literature, most of the extension constructions suffer from this constraint. As a result, our constructions allow a great flexibility of choosing parameters of FHS sets for a given frequency-hopping spread spectrum system.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Wireless Communication Networks Research · graph theory and CDMA systems
