2000 character limit reached
New families of optimal frequency hopping sequence sets (1506.07372v1)
Published 24 Jun 2015 in cs.IT and math.IT
Abstract: 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 FHS sets, including an algebraic construction via the linear mapping, two direct constructions by using cyclotomic classes and recursive constructions based on cyclic difference matrices. By these constructions, a number of series of new FHS sets are then produced. These FHS sets are optimal with respect to the Peng-Fan bounds.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.
