<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:06:09Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/5049" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/5049</identifier><datestamp>2026-05-14T13:51:32Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Vamvatsikos, Aggelos</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2006-12-28T15:46:37Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2011-12-28T07:23:51Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2006-12-28T15:46:37Z</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/5049</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">6476245</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Tightness of the Wagner-Anantharam (W-A) outer bound, for the quadratic Gaussian two-terminal source coding&#xd;
problem, is examined. The proof of the sum rate constraint for the&#xd;
rate region of this problem provides some hints on possible&#xd;
looseness of the bound. We prove tightness to the rate&#xd;
region for this setup, by first proving tightness for the&#xd;
many-help-one problem with conditional independence. We also look at the performance of the W-A bound and find the&#xd;
worst choice of the auxiliary random variable X, appearing in the&#xd;
expression of the bound, for the sum rate constraint.&#xd;
&#xd;
In the second part of this work, the Gaussian point-to-point source&#xd;
coding problem is considered. The error exponent for this problem&#xd;
was presented by Ihara and Kubo. We generalize the&#xd;
Gaussian method of types, introduced by Arikan and Merhav, and use Marton's approach  to retrieve&#xd;
the best achievable error exponent for this setup. Our method is&#xd;
readily extendable to more complex Gaussian source coding problems.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent">285055 bytes</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Wagner-Anantharam outer bound</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">source coding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">source coding error exponent</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Gaussian point-to-point  problem</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">rate-distortion theory</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">On the Wagner-Anantharam outer bound and achievable Gaussian source coding exponents</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author">Vamvatsikos, Aggelos</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="53579db5-22e0-492b-9406-6ff492115071">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>On the Wagner-Anantharam outer bound and achievable Gaussian source coding exponents&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2006-12-28T15:46:37Z&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Vamvatsikos, Aggelos&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>Wagner-Anantharam outer bound&lt;/Keyword>
    &lt;Keyword>source coding&lt;/Keyword>
    &lt;Keyword>source coding error exponent&lt;/Keyword>
    &lt;Keyword>Gaussian point-to-point  problem&lt;/Keyword>
    &lt;Keyword>rate-distortion theory&lt;/Keyword>
   	&lt;Abstract>Tightness of the Wagner-Anantharam (W-A) outer bound, for the quadratic Gaussian two-terminal source coding&#xd;
problem, is examined. The proof of the sum rate constraint for the&#xd;
rate region of this problem provides some hints on possible&#xd;
looseness of the bound. We prove tightness to the rate&#xd;
region for this setup, by first proving tightness for the&#xd;
many-help-one problem with conditional independence. We also look at the performance of the W-A bound and find the&#xd;
worst choice of the auxiliary random variable X, appearing in the&#xd;
expression of the bound, for the sum rate constraint.&#xd;
&#xd;
In the second part of this work, the Gaussian point-to-point source&#xd;
coding problem is considered. The error exponent for this problem&#xd;
was presented by Ihara and Kubo. We generalize the&#xd;
Gaussian method of types, introduced by Arikan and Merhav, and use Marton&amp;apos;s approach  to retrieve&#xd;
the best achievable error exponent for this setup. Our method is&#xd;
readily extendable to more complex Gaussian source coding problems.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>