articleIEEE Communications LettersOct 1, 2002Closed access

Compression of binary sources with side information at the decoder using LDPC codes

Texas A&M University

Indexed incrossref

Abstract

We show how low-density parity-check (LDPC) codes can be used to compress close to the Slepian-Wolf limit for correlated binary sources. Focusing on the asymmetric case of compression of an equiprobable memoryless binary source with side information at the decoder, the approach is based on viewing the correlation as a channel and applying the syndrome concept. The encoding and decoding procedures are explained in detail. The performance achieved is seen to be better than recently published results using turbo codes and very close to the Slepian-Wolf limit.

Citation impact

664
total citations
FWCI
17.32
Percentile
100%
References
14
Citations per year

Authors

3

Topics & keywords

Keywords
  • Low-density parity-check code
  • Decoding methods
  • Turbo code
  • Computer science
  • Noisy-channel coding theorem
  • Algorithm
  • Binary number
  • Distributed source coding
No related works found for this paper.