English

Constrained Source Coding with Side Information

Information Theory 2016-11-15 v1 math.IT

Abstract

The source-coding problem with side information at the decoder is studied subject to a constraint that the encoder---to whom the side information is unavailable---be able to compute the decoder's reconstruction sequence to within some distortion. For discrete memoryless sources and finite single-letter distortion measures, an expression is given for the minimal description rate as a function of the joint law of the source and side information and of the allowed distortions at the encoder and at the decoder. The minimal description rate is also computed for a memoryless Gaussian source with squared-error distortion measures. A solution is also provided to a more general problem where there are more than two distortion constraints and each distortion function may be a function of three arguments: the source symbol, the encoder's reconstruction symbol, and the decoder's reconstruction symbol.

Keywords

Cite

@article{arxiv.1301.5109,
  title  = {Constrained Source Coding with Side Information},
  author = {Amos Lapidoth and Andreas Malär and Michèle Wigger},
  journal= {arXiv preprint arXiv:1301.5109},
  year   = {2016}
}

Comments

submitted to IEEE Transactions on Information Theory

R2 v1 2026-06-21T23:13:20.527Z