<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.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-21T03:57:52Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/16273" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/16273</identifier><datestamp>2026-09-24T03:27:22Z</datestamp><setSpec>com_11375_271</setSpec><setSpec>col_11375_272</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="advisor">Chen, Jun</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Khezeli, Kia</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department" lang="en_US">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2014-10-31T19:53:09Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2014-10-31T19:53:09Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2014-11</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/16273</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/20821</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">A converse method is developed for the source broadcast problem. Specifically, it is&#xd;
shown that the separation architecture is optimal for a variant of the source broadcast&#xd;
problem and the associated source-channel separation theorem can be leveraged, via&#xd;
a reduction argument, to establish a necessary condition for the original problem,&#xd;
which uni es several existing results in the literature. Somewhat surprisingly, this&#xd;
method, albeit based on the source-channel separation theorem, can be used to prove&#xd;
the optimality of non-separation based schemes and determine the performance limits&#xd;
in certain scenarios where the separation architecture is suboptimal.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degreetype" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">Master of Applied Science (MASc)</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">Network Information Theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Broadcast Channels</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Joint Source Channel Coding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Gaussian Broadcast Channel</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Separation Theorem</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Side Information</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">A Source-Channel Separation Theorem with Application to the Source Broadcast Problem</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim></metadata></record></GetRecord></OAI-PMH>