Ozarow- Type Outer Bounds for Memoryless Sources and Channels
Ozarow- Type Outer Bounds for Memoryless Sources and Channels
复制标题
DOI：
10.1109/isit.2018.8437864
复制
发表时间：
2018-06
期刊：
影响因子：
--
通讯作者：
Yuval Kochman;Or Ordentlich;Yury Polyanskiy
中科院分区：
文献类型：
--
作者：
Yuval Kochman;Or Ordentlich;Yury Polyanskiy
提出了多描述信源编码和信源信道联合广播两个问题。对于多重描述问题，我们重新讨论了Ozarow建立不可能结果的技术，并将其扩展到一般来源和失真度量。对于在广播信道上发送信源的问题，我们重新讨论了Reznik、Feder和Zamir的有界技术，并将其扩展到一般信源、失真度量和广播信道。虽然得到的边界并不比文献中现有的结果更好，但它们相对容易评估，并且它们的推导揭示了两种边界技术之间的相似之处。
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 Ozarow's 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.