Robust Slepian-Wolf coding Using Low-Density Graph Codes

dc.contributor.advisor	Wong, Kon Max	en_US
dc.contributor.author	Huang, Min	en_US
dc.contributor.department	Electrical and Computer Engineering	en_US
dc.date.accessioned	2014-06-18T16:46:54Z
dc.date.available	2014-06-18T16:46:54Z
dc.date.created	2011-06-03	en_US
dc.date.issued	2010	en_US
dc.description.abstract	<p>In this thesis, Robust Slepian-Wolf coding problem is discussed. Two correlated source sequences Xⁿ and Yⁿ are encoded at separate encoders and decoded together. When the encoder of source Y is broken, another sequence Xⁿ still can be decoded to achieve a nontrivial distortion. Further, Xⁿ can be recovered losslessly once that broken encoder is restored. A practical coding scheme is developed using low density graph codes. Moreover, by generalizing the coding scheme of Robust Slepian-Wolf coding problem, two approaches are proposed for the Wyner-Ziv problem using the low density graph codes.</p>	en_US
dc.description.degree	Master of Applied Science (MASc)	en_US
dc.identifier.other	opendissertations/4512	en_US
dc.identifier.other	5530	en_US
dc.identifier.other	2046084	en_US
dc.identifier.uri	http://hdl.handle.net/11375/9384
dc.subject	Electrical and Computer Engineering	en_US
dc.subject	Electrical and Computer Engineering	en_US
dc.title	Robust Slepian-Wolf coding Using Low-Density Graph Codes	en_US
dc.type	thesis	en_US

Files

Now showing 1 - 1 of 1