Analysis of protocol sequence sets for asynchronous slow frequency hopping
A. Jordan · 2002
The error probability bound is shown for asynchronous slow frequency hopping multiple access channel with non-random protocol sequence sets. Protocol sequence sets with interleaved codes are considered. This bound depends on the maximum and average Hamming correlation properties of the protocol sequence set applied. We apply this result to a protocol sequence set derived from a Reed-Solomon code.