Back to search

McMaster University

Robust Slepian-Wolf coding Using Low-Density Graph Codes

Abstract

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>

Degree

thesis:*
Department dc:contributor.department
Electrical and Computer Engineering
Year dc:date.issued
2010

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Huang, Min
Advisor dc:contributor.advisor
  • Wong, Kon Max

Subjects

dc:subject × 1

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/4512
5530
2046084

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Huang, Min. Robust Slepian-Wolf coding Using Low-Density Graph Codes. 2010. http://hdl.handle.net/11375/9384