By Topic

A min-max theorem for antijamming group codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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).

Published in:

Information Theory, IEEE Transactions on  (Volume:30 ,  Issue: 6 )