Discriminatory source coding for a noiseless broadcast channel

We introduce a new problem of broadcast source coding with a discrimination requirement - there is an eavesdropping user from whom we wish to withhold the true message in an entropic sense. Binning can achieve the Slepian-Wolf rate, but at the cost of full information leakage to the eavesdropper. Our main result is a lower bound that implies that any entropically efficient broadcast scheme must be "like binning" in that it also must leak significant information to eavesdroppers.


Published in:
2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 77-81
Presented at:
IEEE International Symposium on Information Theory, Adelaide, AUSTRALIA, Sep 04-09, 2005
Year:
2005
Publisher:
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN:
0-7803-9150-0
Keywords:
Laboratories:




 Record created 2011-10-17, last modified 2018-03-17


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)