On cascade source coding with a side information 'vending machine'

Document Type

Conference Proceeding

Publication Date

12-1-2012

Abstract

The model of a side information 'vending machine' accounts for scenarios in which acquiring side information is costly and thus should be done efficiently. In this paper, the three-node cascade source coding problem is studied under the assumption that a side information vending machine is available either at the intermediate or at the end node. In both cases, a single-letter characterization of the available trade-offs among the rate, the distortions in the reconstructions at the intermediate and at the end node, and the cost in acquiring the side information are derived under given conditions. © 2012 IEEE.

Identifier

84873179819 (Scopus)

ISBN

[9781467302234]

Publication Title

2012 IEEE Information Theory Workshop Itw 2012

External Full Text Location

https://doi.org/10.1109/ITW.2012.6404735

First Page

552

Last Page

556

This document is currently not available here.

Share

COinS