TY - GEN

T1 - Robust coding for lossy computing with receiver-side observation costs

AU - Ahmadi, Behzad

AU - Simeone, Osvaldo

N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.

PY - 2011

Y1 - 2011

N2 - 1An 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; (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.

AB - 1An 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; (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.

UR - http://www.scopus.com/inward/record.url?scp=80054829167&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80054829167&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2011.6034115

DO - 10.1109/ISIT.2011.6034115

M3 - Conference contribution

AN - SCOPUS:80054829167

SN - 9781457705953

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2939

EP - 2943

BT - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

T2 - 2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011

Y2 - 31 July 2011 through 5 August 2011

ER -