期刊
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
卷 E105A, 期 3, 页码 353-362出版社
IEICE-INST ELECTRONICS INFORMATION COMMUNICATION ENGINEERS
DOI: 10.1587/transfun.2021TAP0005
关键词
chromatic number; covering; finite blocklength; lossy source coding; side information; zero-error coding
类别
资金
- JSPS KAKENHI [JP19K04368]
This article examines the coding problem for lossy source coding with side information at the decoder, known as the Wyner-Ziv source coding problem. By utilizing the chromatic number and notions of covering of a set, an equivalent expression of the minimum rate is provided, allowing for analysis of the coding problem in relation to graph coloring and covering.
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 notions of covering of a set. This allows us to analyze the coding problem in terms of graph coloring and covering.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据