• DocumentCode
    2992709
  • Title

    Lossy source coding with Gaussian or erased side-information

  • Author

    Perron, Etienne ; Diggavi, Suhas ; Telatar, Emre

  • Author_Institution
    EPFL, Lausanne, Switzerland
  • fYear
    2009
  • fDate
    June 28 2009-July 3 2009
  • Firstpage
    1035
  • Lastpage
    1039
  • Abstract
    In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side-information. The first setup is when the source and side-information are jointly Gaussian and the distortion measure is quadratic. The second setup is when the side-information is an erased version of the source. We begin with the observation that in both these cases the Wyner-Ziv and conditional rate-distortion functions are equal. We further find that there is a continuum of optimal strategies for the conditional rate distortion problem in both these setups. Next, we consider the case when there are two decoders with access to different side-information sources. For the case when the encoder has access to the side-information we establish bounds on the rate-distortion function and a sufficient condition for tightness. Under this condition, we find a characterization of the rate-distortion function for physically degraded side-information. This characterization holds for both the Gaussian and erasure setups.
  • Keywords
    Gaussian processes; rate distortion theory; source coding; Gaussian side-information; Wyner-Ziv function; conditional rate distortion problem; conditional rate-distortion function; decoder; encoder; erased side-information; lossy source coding; physically degraded side-information; quadratic distortion measure; source information; Decoding; Degradation; Distortion measurement; Rate-distortion; Source coding; Sufficient conditions; Video coding; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • Conference_Location
    Seoul
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    978-1-4244-4313-0
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5206065
  • Filename
    5206065