Side-Information Scalable Source Coding

DOI10.1109/TIT.2008.2006399MaRDI QIDQ3604878zbMATH OpenOpenAlexFDO

Authors Chao Tian, Suhas N. Diggavi

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0707.4597

zbMATH Keywords

Scalable source codingside informationsuccessive refinement

Mathematics Subject Classification ID

Source coding (94A29)

Abstract: The problem of side-information scalable (SI-scalable) source coding is considered in this work, where the encoder constructs a progressive description, such that the receiver with high quality side information will be able to truncate the bitstream and reconstruct in the rate distortion sense, while the receiver with low quality side information will have to receive further data in order to decode. We provide inner and outer bounds for general discrete memoryless sources. The achievable region is shown to be tight for the case that either of the decoders requires a lossless reconstruction, as well as the case with degraded deterministic distortion measures. Furthermore we show that the gap between the achievable region and the outer bounds can be bounded by a constant when square error distortion measure is used. The notion of perfectly scalable coding is introduced as both the stages operate on the Wyner-Ziv bound, and necessary and sufficient conditions are given for sources satisfying a mild support condition. Using SI-scalable coding and successive refinement Wyner-Ziv coding as basic building blocks, a complete characterization is provided for the important quadratic Gaussian source with multiple jointly Gaussian side-informations, where the side information quality does not have to be monotonic along the scalable coding order. Partial result is provided for the doubly symmetric binary source with Hamming distortion when the worse side information is a constant, for which one of the outer bound is strictly tighter than the other one.

Recommendations

• Constrained Source-Coding With Side Information
• Cyclic Division Algebras: A Tool for Space-Time Coding
• On source coding with side-information-dependent distortion measures
• Universal decoding for source-channel coding with side information
• Data-Processing Bounds for Scalar Lossy Source Codes With Side Information at the Decoder
• On Lossless Coding With Coded Side Information
• Zero-Error Source–Channel Coding With Side Information
• Cascade Source Coding With a Side Information Vending Machine
• Source Coding With Distortion Side Information
• Coding With Side Information for Rate-Constrained Consensus

Cited in

(8)

• Cascade Source Coding With a Side Information Vending Machine
• Reliability in Source Coding With Side Information
• Fixed-rate encoding of individual sequences with side information
• Universal decoding for source-channel coding with side information
• Error exponents in scalable source coding
• Computation and analysis of the n -layer scalable rate-distortion function
• Discriminatory Lossy Source Coding: Side Information Privacy
• Joint iterative decoding and estimation for side-informed data hiding

This page was built for publication: Side-Information Scalable Source Coding

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604878)