A min-max theorem for antijamming group codes
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).
- Publication:
-
IEEE Transactions on Information Theory
- Pub Date:
- November 1984
- Bibcode:
- 1984ITIT...30..792E
- Keywords:
-
- Binary Codes;
- Error Correcting Codes;
- Frequency Hopping;
- Group Theory;
- Jamming;
- Minimax Technique;
- Channels (Data Transmission);
- Communication Theory;
- Communications and Radar