Discriminatory lossy source coding: Side information privacy

Ravi Tandon, Lalitha Sankar, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

The Heegard-Berger problem models a case in which encoding at a source has to account for two decoders, one with and one without correlated side information when the same information is not available at the encoder. The Heegard-Berger encoding scheme is proved to be rate-optimal even when an additional constraint on the privacy of side information is imposed at the uninformed decoder. The results are illustrated for a binary source with erasure side information and Hamming distortion, a result which is also of independent interest.

Original languageEnglish (US)
Title of host publication2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
DOIs
StatePublished - Dec 1 2011
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: Dec 5 2011Dec 9 2011

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Other

Other54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
CountryUnited States
CityHouston, TX
Period12/5/1112/9/11

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Tandon, R., Sankar, L., & Poor, H. V. (2011). Discriminatory lossy source coding: Side information privacy. In 2011 IEEE Global Telecommunications Conference, GLOBECOM 2011 [6134031] (GLOBECOM - IEEE Global Telecommunications Conference). https://doi.org/10.1109/GLOCOM.2011.6134031