2000 character limit reached
Construction of three classes of Strictly Optimal Frequency-Hopping Sequence Sets (1905.04940v1)
Published 13 May 2019 in cs.IT and math.IT
Abstract: 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 classes are based from the trace map.
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.
