[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article

The duality between information embedding and source coding with side information and some applications

Published: 01 September 2006 Publication History

Abstract

Aspects of the duality between the information-embedding problem and the Wyner-Ziv (1976) problem of source coding with side information at the decoder are developed and used to establish a spectrum new results on these and related problems, with implications for a number of important applications. The single-letter characterization of the information-embedding problem is developed and related to the corresponding characterization of the Wyner-Ziv problem, both of which correspond to optimization of a common mutual information difference. Dual variables and dual Markov conditions are identified, along with the dual role of noise and distortion in the two problems. For a Gaussian context with quadratic distortion metric, a geometric interpretation of the duality is developed. From such insights, we develop a capacity-achieving information-embedding system based on nested lattices. We show the resulting encoder-decoder has precisely the same decoder-encoder structure as the corresponding Wyner-Ziv system based on nested lattices that achieves the rate-distortion limit. For a binary context with Hamming distortion metric, the information-embedding capacity is developed, along with its relationship to the corresponding Wyner-Ziv rate-distortion function. In turn, an information-embedding system for this case based on nested linear codes is constructed having an encoder-decoder that is identical to the decoder-encoder structure for the corresponding system that achieves the Wyner-Ziv rate-distortion limit. Finally, based on these results, a simple layered joint source-channel coding system is developed with a perfectly symmetric encoder-decoder structure. Its application and performance is discussed in a broadcast setting in which there is a need to control the fidelity experienced by different receivers. Among other results, we show that such systems and their multilayer extensions retain attractive optimality properties in the Gaussian-quadratic case, but not in the binary-Hamming case.

Cited By

View all
  1. The duality between information embedding and source coding with side information and some applications

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image IEEE Transactions on Information Theory
    IEEE Transactions on Information Theory  Volume 49, Issue 5
    May 2003
    314 pages

    Publisher

    IEEE Press

    Publication History

    Published: 01 September 2006

    Qualifiers

    • Research-article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 14 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2025)Reliable Robust Adaptive Steganographic Coding Based on Nested Polar CodesIEEE Transactions on Signal Processing10.1109/TSP.2024.351075573(12-25)Online publication date: 1-Jan-2025
    • (2024)Weighted Parity-Check Codes for Channels With State and Asymmetric ChannelsIEEE Transactions on Information Theory10.1109/TIT.2024.340304970:8(5573-5588)Online publication date: 1-Aug-2024
    • (2023)Error Exponents of the Dirty-Paper and Gel’fand–Pinsker ChannelsIEEE Transactions on Information Theory10.1109/TIT.2023.331421069:12(7479-7498)Online publication date: 1-Dec-2023
    • (2023)Cover Reproducible Steganography via Deep Generative ModelsIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2022.321756920:5(3787-3798)Online publication date: 1-Sep-2023
    • (2022)Weighted Parity-Check Codes for Channels with State and Asymmetric Channels2022 IEEE International Symposium on Information Theory (ISIT)10.1109/ISIT50566.2022.9834658(3103-3108)Online publication date: 26-Jun-2022
    • (2019)Learning to Compress Using Deep AutoEncoder2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2019.8919866(930-936)Online publication date: 24-Sep-2019
    • (2018)Asymptotically Optimum Perfect Universal Steganography of Finite Memoryless SourcesIEEE Transactions on Information Theory10.1109/TIT.2017.278353964:2(1199-1216)Online publication date: 1-Feb-2018
    • (2018)Rate Distortion Via Restricted Boltzmann Machines2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)10.1109/ALLERTON.2018.8635888(1052-1059)Online publication date: 2-Oct-2018
    • (2017)An Achievable Rate Region Based on Coset Codes for Multiple Access Channel With StatesIEEE Transactions on Information Theory10.1109/TIT.2017.272606963:10(6393-6415)Online publication date: 12-Sep-2017
    • (2017)Strong Secrecy for Cooperative Broadcast ChannelsIEEE Transactions on Information Theory10.1109/TIT.2016.262205863:1(469-495)Online publication date: 1-Jan-2017
    • Show More Cited By

    View Options

    View options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media