Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ISIT.2005.1523296 | 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2 |
Keywords | Field | DocType |
lower bound,source code,entropy,source coding,information,channel coding | Broadcasting,Eavesdropping,Information leakage,Upper and lower bounds,Source code,Computer science,Computer network,Shannon–Fano coding,Broadcast channels,Variable-length code | Conference |
Citations | PageRank | References |
4 | 0.50 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leonard Grokop | 1 | 72 | 6.55 |
| A. Sahai | 2 | 1888 | 198.31 |
| Michael Gastpar | 3 | 2740 | 278.17 |