<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> / Master of Applied Science (MASc)
Identifer | oai:union.ndltd.org:mcmaster.ca/oai:macsphere.mcmaster.ca:11375/9384 |
Date | January 2010 |
Creators | Huang, Min |
Contributors | Wong, Kon Max, Electrical and Computer Engineering |
Source Sets | McMaster University |
Detected Language | English |
Type | thesis |
Page generated in 0.0017 seconds