<?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-21T01:18:55Z</responseDate><request verb="GetRecord" identifier="oai:macsphere.mcmaster.ca:11375/22902" metadataPrefix="dim">https://prod-ms-be.lib.mcmaster.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:macsphere.mcmaster.ca:11375/22902</identifier><datestamp>2026-09-24T06:34:40Z</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">Dumitrescu, Sorina</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Chen, Jun</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author">Elzouki, Dania</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">2018-05-08T13:33:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-05-08T13:33:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2018</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/11375/22902</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://doi.org/10.71548/10186</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">In this thesis we propose two lattice-based robust distributed source coding systems, one for two correlated sources and the other for three correlated sources. We provide a detailed performance analysis under the high resolution assumption. It is shown that, in a certain asymptotic regime, our scheme for two correlated sources achieves the information-theoretic limit of quadratic multiple description coding (MDC) when the lattice dimension goes to infinity, whereas a variant of the random coding scheme by Chen and Berger with Gaussian codes is 0.5 bits away from this limit. Our analysis also shows that, under the same asymptotic regime, when the lattice dimension goes to infinity, the proposed scheme for three correlated sources is very close to the theoretical bound for the symmetric quadratic Gaussian MDC problem with single description and all three descriptions decoders.</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">Doctor of Philosophy (PhD)</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Distributed source coding</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">lattice quantization</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">high resolution analysis</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Lattice-based Robust Distributed Coding Scheme for Correlated Sources</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>