Constrained Source-Coding With Side Information

DOI10.1109/TIT.2014.2314634MaRDI QIDQ2986319zbMATH OpenFDO

Authors Amos Lapidoth, Andreas Malär, Michèle Angela Wigger

Publication date 16 May 2017

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

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

Mathematics Subject Classification ID

Information theory (general) (94A15) Source coding (94A29)

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

Cited in

(7)

• Discriminatory Lossy Source Coding: Side Information Privacy
• Universal decoding for source-channel coding with side information
• Reliability in Source Coding With Side Information
• Fixed-rate encoding of individual sequences with side information
• Side-Information Scalable Source Coding
• Cascade Source Coding With a Side Information Vending Machine
• Output Constrained Lossy Source Coding With Limited Common Randomness

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

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