2018/06/26 by Xianhua Niu, Chaoping Xing, Niu, Xianhua +1
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #Wireless Communication Networks Research #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1806.09869
arxiv created 2018/06/26 · openalex publication_date 2018/06/26 · arxiv updated 2018/06/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.