Robust coding for lossy computing with receiver-side observation costs

1 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...

Full description

Saved in:
Bibliographic Details
Published in:2011 IEEE International Symposium on Information Theory Proceedings pp. 2939 - 2943
Main Authors: Ahmadi, B., Simeone, O.
Format: Conference Proceeding
Language:English
Published: IEEE 01.07.2011
Subjects:
ISBN:1457705966, 9781457705960
ISSN:2157-8095
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first