Discriminatory Lossy Source Coding: Side Information Privacy

Author

Tandon, Ravi ; Sankar, Lalitha ; Poor, H. Vincent

Author_Institution

Princeton Univ., Princeton, NJ, USA

Volume

59

Issue

9

fYear

2013

fDate

Sept. 2013

Firstpage

5665

Lastpage

5677

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.

Keywords

Hamming codes; binary codes; correlation methods; data privacy; decoding; rate distortion theory; source coding; Hamming distortion; binary symmetric source; correlated side information; discriminatory lossy source coding; encoder side information; erasure side information; rate-distortion-equivocation tuples; side information privacy; source encoder; uninformed decoder; Channel coding; Decoding; Indexes; Privacy; Rate-distortion; Source coding; Discriminatory coding; Heegard–Berger problem; Kaspi problem; equivocation; information privacy; informed and uninformed encoders; lossy source coding; side information;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/TIT.2013.2259613

Filename

6507243