This paper considers frequency hopped-multilevel frequency shift keyed (FH-MFSK) spread spectrum communication with possible application to mobile telephone service. Comparisons between randomly chosen address vectors, chirp vectors, and Einarsson\´s finite field vectors revealed that the latter two were equivalent (as expected) and somewhat better than random coding; however, the difference diminishes as bandwidth increases. Simple FH-MFSK yielded efficiencies around 0.36 bits/s/Hz for bandwidths in the range 3-20 MHz. A checking procedure is also described which, by a closer examination of the structure of the received data, is able to reduce errors markedly. It enables efficiencies around 0.55 bits/s/Hz for bandwidths in the range 3-20 MHz, which is close to that achievable via convolutional coding using dual-

codes.