Title :
A min-max theorem for antijamming group codes
fDate :
11/1/1984 12:00:00 AM
Abstract :
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).
Keywords :
Frequency-hop communication; Group coding; Pseudonoise-coded communication; Radio communication countermeasures; Communication systems; Decoding; Error probability; Frequency; Interference channels; Interference constraints; Jamming; Law; Legal factors; Spread spectrum communication;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1984.1056977