An Equivalent Expression for the Wyner-Ziv Source Coding Problem

Tetsunao Matsuta, T. Uyematsu
{"title":"An Equivalent Expression for the Wyner-Ziv Source Coding Problem","authors":"Tetsunao Matsuta, T. Uyematsu","doi":"10.1587/transfun.2021tap0005","DOIUrl":null,"url":null,"abstract":"We consider the coding problem for lossy source coding with side information at the decoder, which is known as the Wyner-Ziv source coding problem. The goal of the coding problem is to find the minimum rate such that the probability of exceeding a given distortion threshold is less than the desired level. We give an equivalent expression of the minimum rate by using the chromatic number and a notion of covering of a set. This allows us to analyze the coding problem in terms of graph coloring and covering.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 International Symposium on Information Theory and Its Applications (ISITA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1587/transfun.2021tap0005","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We consider the coding problem for lossy source coding with side information at the decoder, which is known as the Wyner-Ziv source coding problem. The goal of the coding problem is to find the minimum rate such that the probability of exceeding a given distortion threshold is less than the desired level. We give an equivalent expression of the minimum rate by using the chromatic number and a notion of covering of a set. This allows us to analyze the coding problem in terms of graph coloring and covering.
Wyner-Ziv源编码问题的等价表达式
我们考虑在解码器处有侧信息的有损源编码的编码问题,称为Wyner-Ziv源编码问题。编码问题的目标是找到最小的速率,使得超过给定失真阈值的概率小于期望的水平。利用色数和集合的覆盖概念,给出了最小速率的等价表达式。这允许我们从图形着色和覆盖的角度来分析编码问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信