Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem

Simple item page
dc.creatorWagner, Aaron B.
dc.creatorTavildar, Saurabha
dc.creatorViswanath, Pramod
dc.date2005-10-31
dc.date2008-02-09
dc.date.accessioned2026-07-07T09:19:24Z
dc.date.available2026-07-07T09:19:24Z
dc.descriptionWe determine the rate region of the quadratic Gaussian two-encoder source-coding problem. This rate region is achieved by a simple architecture that separates the analog and digital aspects of the compression. Furthermore, this architecture requires higher rates to send a Gaussian source than it does to send any other source with the same covariance. Our techniques can also be used to determine the sum rate of some generalizations of this classical problem. Our approach involves coupling the problem to a quadratic Gaussian ``CEO problem.''
dc.descriptionContains additional results. To appear in IEEE Trans. Inf. Theory
dc.identifierhttps://arxiv.org/abs/cs/0510095
dc.identifierhttp://arxiv.org/abs/cs/0510095
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/154374
dc.subjectInformation Theory
dc.subjectH.1.1; E.4
dc.titleRate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem
dc.typetext

Files

Collections

arXiv