On Scalable Source Coding With Decoder Side Informations Conference Paper uri icon

abstract

  • We consider the problem of scalable source coding with decoder side informations. Two special cases of this problem have been investigated in the literature, namely successive refinement Wyner-Ziv (SR-WZ) coding and side-information scalable (SI-Scalable) coding, whose distinction lies in the degradedness of the side informations. In this work, we first show the achievable region for the SI-scalable problem provided in a previous work is tight when either the first stage or the second stage requires lossless reconstruction. Then the notion of perfectly scalable coding is introduced as both the stages operate on the Wyner-Ziv bound, and a set of necessary and sufficient conditions is given for sources satisfying a mild support condition. Furthermore, generalizing the coding scheme for the SR-WZ and SI-scalable coding, we provide a conclusive solution for the (multistage) quadratic Gaussian scalable coding problem with jointly Gaussian side informations in an arbitrary order of quality. 2007 IEEE.

name of conference

  • 2007 IEEE International Symposium on Information Theory

published proceedings

  • 2007 IEEE International Symposium on Information Theory

author list (cited authors)

  • Tian, C., & Diggavi, S. N.

complete list of authors

  • Tian, Chao||Diggavi, Suhas N

publication date

  • January 1, 2007 11:11 AM