Abstract
A lossy source coding problem is studied in which a source encoder communicates with two decoders, one with and one without correlated side information with an additional constraint on the privacy of the side information at the uninformed decoder. Two cases of this problem arise depending on the availability of the side information at the encoder. The set of all feasible rate-distortion-equivocation tuples is characterized for each case. The difference between the informed and uninformed cases and the advantages of encoder side information for enhancing privacy are highlighted for a binary symmetric source with erasure side information and Hamming distortion.
| Original language | English (US) |
|---|---|
| Article number | 6507243 |
| Pages (from-to) | 5665-5677 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 59 |
| Issue number | 9 |
| DOIs | |
| State | Published - 2013 |
Keywords
- Discriminatory coding
- Heegard-Berger problem
- Kaspi problem
- equivocation
- information privacy
- informed and uninformed encoders
- lossy source coding
- side information
ASJC Scopus subject areas
- Information Systems
- Computer Science Applications
- Library and Information Sciences