LDPC codes for the Slepian-Wolf coding

Abstract

LDPC codes are among the few FEC schemes that have been used for distributed data compression schemes, like the Slepian-Wolf encoding. An LDPC code having good degree distribution polynomials, along with a large girth and large minimum distance, can compress close to the Slepian-Wolf limit. In this paper, we describe a method to choose good degree distribution polynomials and the corresponding code construction for binary sources. Furthermore, the performance of the proposed compression scheme is also demonstrated. In selected cases, we improve the best schemes reported in literature.