  We introduce randomized Limited View (LV) adversary codes that provide
protection against an adversary that uses their partial view of the
communication to construct an adversarial error vector to be added to the
channel. For a codeword of length N, the adversary selects a subset of \rho_rN
of the codeword components to "see", and then "adds" an adversarial error
vector of weight \rho_wN to the codeword. Performance of the code is measured
by the probability of the decoder failure in recovering the sent message. An
(N, q^{RN},\delta)-limited view adversary code ensures that the success chance
of the adversary in making decoder fail, is bounded by \delta when the
information rate of the code is at least R. Our main motivation to study these
codes is providing protection for wireless communication at the physical layer
of networks.
  We formalize the definition of adversarial error and decoder failure,
construct a code with efficient encoding and decoding that allows the adversary
to, depending on the code rate, read up to half of the sent codeword and add
error on the same coordinates. The code is non-linear, has an efficient
decoding algorithm, and is constructed using a message authentication code
(MAC) and a Folded Reed-Solomon (FRS) code. The decoding algorithm uses an
innovative approach that combines the list decoding algorithm of the FRS codes
and the MAC verification algorithm to eliminate the exponential size of the
list output from the decoding algorithm. We discuss application of our results
to Reliable Message Transmission problem, and open problems for future work.
