The equivalence between Slepian-Wolf coding and channel coding under density evolution

Authors:
Jun Chen;Da-ke He;Ashish Jagmohan
Affiliations:
Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;SlipStream Data, Research In Motion, Waterloo, ON, Canada and IBM Thomas J. Watson Research Center, Yorktown Heights, NY;IBM Thomas J. Watson Research Center, Yorktown Heights, NY
Venue:
IEEE Transactions on Communications
Year:
2009

Citing 15
Cited 1

Probabilistic reasoning in intelligent systems: networks of plausible inference

Probabilistic reasoning in intelligent systems: networks of plausible inference
Information Theory: Coding Theorems for Discrete Memoryless Systems

Information Theory: Coding Theorems for Discrete Memoryless Systems
Compression with Side Information Using Turbo Codes

DCC '02 Proceedings of the Data Compression Conference
Distributed Code Constructions for the Entire Slepian-Wolf Rate Region for Arbitrarily Correlated Sources

DCC '04 Proceedings of the Conference on Data Compression
Slepian-Wolf Coding for Nonuniform Sources Using Turbo Codes

DCC '04 Proceedings of the Conference on Data Compression
Successive refinement for the Wyner-Ziv problem and layered code design

IEEE Transactions on Signal Processing - Part II
Efficient erasure correcting codes

IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding

IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Nested linear/lattice codes for structured multiterminal binning

IEEE Transactions on Information Theory
Distributed source coding using syndromes (DISCUS): design and construction

IEEE Transactions on Information Theory
Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds

IEEE Transactions on Information Theory
Density evolution for asymmetric memoryless channels

IEEE Transactions on Information Theory
On code design for the Slepian-Wolf problem and lossless multiterminal networks

IEEE Transactions on Information Theory
Low-Complexity Approaches to Slepian–Wolf Near-Lossless Distributed Data Compression

IEEE Transactions on Information Theory

On the duality between Slepian-Wolf coding and channel coding under mismatched decoding

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.06

Visualization

Abstract

We consider Slepian-Wolf code design based on low-density parity-check (LDPC) coset codes. The density evolution formula for Slepian-Wolf coding is derived. An intimate connection between Slepian-Wolf coding and channel coding is then established. Specifically we show that, under density evolution, each Slepian-Wolf coding problem is equivalent to a channel coding problem for a binary-input output-symmetric channel.