Wyner-Ziv源编码问题的等价表达式

2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI:10.1587/transfun.2021tap0005

Tetsunao Matsuta, T. Uyematsu

{"title":"Wyner-Ziv源编码问题的等价表达式","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":"{\"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}","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

摘要

我们考虑在解码器处有侧信息的有损源编码的编码问题，称为Wyner-Ziv源编码问题。编码问题的目标是找到最小的速率，使得超过给定失真阈值的概率小于期望的水平。利用色数和集合的覆盖概念，给出了最小速率的等价表达式。这允许我们从图形着色和覆盖的角度来分析编码问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Equivalent Expression for the Wyner-Ziv Source Coding Problem

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 International Symposium on Information Theory and Its Applications (ISITA)

自引率

0.00%

发文量