By Topic

Coding against myopic adversaries

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)
Sarwate, A.D. ; Inf. Theor. & Applic. Center, Univ. of California, San Diego, CA, USA

A variant on the arbitrarily varying channel (AVC) is proposed in which the jammer is allowed to base its actions on a noisy version of the transmitted codeword. It is shown via a random coding argument that the capacity is the minimum over all discrete memoryless channels (DMCs) that can be induced by memoryless strategies of the adversary. This generalizes two existing models in the AVC literature: the standard AVC in which the jammer does not know the channel input, and the AVC in which the jammer knows the channel input exactly.

Published in:

Information Theory Workshop (ITW), 2010 IEEE

Date of Conference:

Aug. 30 2010-Sept. 3 2010