TY - GEN
T1 - Constrained Wyner-Ziv source coding
AU - Lapidoth, Amos
AU - Malär, Andreas
AU - Wigger, Michèle
PY - 2011/5/13
Y1 - 2011/5/13
N2 - We generalize the Wyner-Ziv source coding problem with side-information at the decoder to the case where the encoder is required to be able to compute the decoder's reconstruction sequence with some fidelity. This requirement limits the extent to which the reconstruction sequence can depend on the side-information, which is not available to the encoder. For finite-alphabet memoryless sources and single-letter distortion measures we compute 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 decoder. We also treat memoryless Gaussian sources with mean squared-error distortion measures.
AB - We generalize the Wyner-Ziv source coding problem with side-information at the decoder to the case where the encoder is required to be able to compute the decoder's reconstruction sequence with some fidelity. This requirement limits the extent to which the reconstruction sequence can depend on the side-information, which is not available to the encoder. For finite-alphabet memoryless sources and single-letter distortion measures we compute 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 decoder. We also treat memoryless Gaussian sources with mean squared-error distortion measures.
UR - https://www.scopus.com/pages/publications/79955755429
U2 - 10.1109/ITA.2011.5743621
DO - 10.1109/ITA.2011.5743621
M3 - Conference contribution
AN - SCOPUS:79955755429
SN - 9781457703614
T3 - 2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings
SP - 471
EP - 472
BT - 2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings
T2 - 2011 Information Theory and Applications Workshop, ITA 2011
Y2 - 6 February 2011 through 11 February 2011
ER -