Constrained Source-Coding With Side Information

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 measure may be a function of three arguments: the source symbol, the encoder's reconstruction symbol, and the decoder's reconstruction symbol.

• Publication year

  2013

• Venue

  IEEE Transactions on Information Theory

• Publication date

  2013-01-22

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TIT.2014.2314634arXiv 1301.5109
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Probability Of Error For Optimal Codes In A Gaussian Channel Pdf

  2015cited by this paper
• Lossy Broadcasting With Complementary Side Information

  2013cited by this paper
• Interactive function computation with reconstruction constraints

  2013cited by this paper
• The Heegard-Berger problem with common receiver reconstructions

  2013cited by this paper
• On the Heegard-Berger problem with common reconstruction constraints

  2012cited by this paper
• Separation of source-network coding and channel coding in wireline networks

  2011cited by this paper
• Rate-distortion functions for source coding with complementary side information

  2011cited by this paper
• Heegard–Berger and Cascade Source Coding Problems With Common Reconstruction Constraints

  2011cited by this paper
• On the separation of lossy source-network coding and channel coding in wireline networks

  2010cited by this paper
• Source coding with common reconstruction and action-dependent side information

  2010cited by this paper
• Coding and Common Reconstruction

  2009influential reference
• On Achievable Rate Regions for Source Coding over Networks

  2009cited by this paper
• Sending a Bi-Variate Gaussian Source over a Gaussian MAC

  2006cited by this paper
• Blahut-Arimoto Algorithm for Computing Channel Capacity and Rate-Distortion with Side Information

  2005cited by this paper
• Duality between channel capacity and rate distortion with two-sided state information

  2002cited by this paper
• Network Information Theory

  2001cited by this paper
• Feedback can at most double Gaussian multiple access channel capacity

  1987cited by this paper
• Two-way source coding with a fidelity criterion

  1985cited by this paper
• Computation of the Wyner-Ziv Rate-Distortion Function

  1983influential reference
• The rate-distortion function for source coding with side information at the decoder

  1976influential reference
• A new class of lower bounds to information rates of stationary sources via conditional rate-distortion functions

  1973cited by this paper
• Convex Analysis: (pms-28)

  1970cited by this paper
• Probability of error for optimal codes in a Gaussian channel

  1959cited by this paper

• Common Function Reconstruction with Information Swapping Terminals

  2024cites this paper
• Strong Converses Using Typical Changes of Measures and Asymptotic Markov Chains

  2023cites this paper
• Two-terminal source coding with common sum reconstruction

  2022cites this paper
• Finite–State Source–Channel Coding for Individual Source Sequences With Source Side Information at the Decoder

  2021cites this paper
• Message and Causal Asymmetric State Transmission Over the State-Dependent Degraded Broadcast Channel

  2020influential citation
• Strategic Communication with Side Information at the Decoder

  2019cites this paper
• Information-Theoretic Limits of Strategic Communication

  2018cites this paper
• Binary lossy coding problem with encoder side information and common reconstruction constraint

  2016cites this paper
• Interactive function computation with reconstruction constraints

  2013cites this paper