Robust Coding for Lossy Computing with Observation Costs

Details Robust Coding for Lossy Computing with Observation Costs Robust Coding for Lossy Computing with Observation Costs

2011-05-24

arxiv.org/abs/1105.4910v4

Computer Science

Information Theory

This manuscript has been withdrawn

Scientific paper

An encoder wishes to minimize the bit rate necessary to guarantee that a decoder is able to calculate a symbol-wise function of a sequence available only at the encoder and a sequence that can be measured only at the decoder. This classical problem, first studied by Yamamoto, is addressed here by including two new aspects: (i) The decoder obtains noisy measurements of its sequence, where the quality of such measurements can be controlled via a cost-constrained "action" sequence, which is taken at the decoder or at the encoder; (ii) Measurement at the decoder may fail in a way that is unpredictable to the encoder, thus requiring robust encoding. The considered scenario generalizes known settings such as the Heegard-Berger-Kaspi and the "source coding with a vending machine" problems. The rate-distortion-cost function is derived in relevant special cases, along with general upper and lower bounds. Numerical examples are also worked out to obtain further insight into the optimal system design.

Affiliated with

Also associated with

No associations

Rating

Robust Coding for Lossy Computing with Observation Costs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Robust Coding for Lossy Computing with Observation Costs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Robust Coding for Lossy Computing with Observation Costs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-190735