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

  • Authors:
  • Jun Chen;Da-ke He;Ashish Jagmohan

  • Affiliations:
  • Department of Electrical and Computer Engineering, McMaster University, Hamilton, ON, Canada;SlipStream Data, 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 Information Theory
  • Year:
  • 2009

Quantified Score

Hi-index 754.90

Visualization

Abstract

In this paper, Slepian-Wolf coding with a mismatched decoding metric is studied. Two different dualities between Slepian-Wolf coding and channel coding under mismatched decoding are established. These two dualities provide a systematic framework for comparing linear Slepian-Wolf codes, nonlinear Slepian-Wolf codes, and variable-rate Slepian-Wolf codes. In contrast with the fact that linear codes suffice to achieve the Slepian-Wolf limit under matched decoding, the minimum rate achievable with nonlinear Slepian-Wolf codes under mismatched decoding can be strictly lower than that achievable with linear Slepian-Wolf codes.