Generation and upper bound of one-coincidence sequences in frequency-hopping multiple-access systems

In frequency-hopping one-coincidence sequences, a specified distance between two adjacent symbols is usually employed to reduce the interference among sequences. We propose a new algorithm to construct one-coincidence sequence sets satisfying distance constraints. Compared to the conventional method, our approach provides a more flexible and general way to generate one-coincidence sequences of variable lengths. We also obtain a tighter upper bound for one-coincidence sequences of odd length, which is independent of code lengths