An Infeasibility Result for the Multiterminal Source-Coding Problem

Simple item page
dc.creatorWagner, Aaron B.
dc.creatorAnantharam, Venkat
dc.date2005-11-30
dc.date.accessioned2026-07-07T08:17:55Z
dc.date.available2026-07-07T08:17:55Z
dc.descriptionWe prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the "CEO problem." The bound recovers many of the converse results that have been established for special cases of the problem, including the recent one for the Gaussian version of the CEO problem.
dc.description42 pages; submitted to IEEE Trans. Inf. Theory
dc.identifierhttps://arxiv.org/abs/cs/0511103
dc.identifierhttp://arxiv.org/abs/cs/0511103
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134256
dc.subjectInformation Theory
dc.subjectH.1.1; E.4
dc.titleAn Infeasibility Result for the Multiterminal Source-Coding Problem
dc.typetext

Files

Collections

arXiv