A min-max theorem for antijamming group codes

Slepian's idea of group codes for analog channels is adapted to the case of antijamming codes. The main result is a codeword error probability characterized by a min-max theorem. The result is illustrated by the special cases of frequency hopping (FH) and direct sequence (DS).