Name
Abstract | ||
|---|---|---|
Two problems, namely multiple-description source coding and joint source-channel broadcasting of a common source, are addressed. For the multiple-description problem, we revisit Ozarowu0027s technique for establishing impossibility results, and extend it to general sources and distortion measures. For the problem of sending a source over a broadcast channel, we revisit the bounding technique of Reznik, Feder and Zamir, and extend it to general sources, distortion measures and broadcast channels. Although the obtained bounds do not improve over existing results in the literature, they are relatively easy to evaluate, and their derivation reveals the similarities between the two bounding techniques. |
Year | Venue | Field |
|---|---|---|
2018 | ISIT | Discrete mathematics,Broadcasting,Source code,Computer science,Communication channel,Impossibility,Broadcast channels,Distortion,Bounding overwatch |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuval Kochman | 1 | 226 | 26.22 |
| Or Ordentlich | 2 | 121 | 18.37 |
| yury polyanskiy | 3 | 1141 | 87.77 |