4.2 Article

An Equivalent Expression for the Wyner-Ziv Source Coding Problem

Publisher

IEICE-INST ELECTRONICS INFORMATION COMMUNICATION ENGINEERS
DOI: 10.1587/transfun.2021TAP0005

Keywords

chromatic number; covering; finite blocklength; lossy source coding; side information; zero-error coding

Funding

  1. JSPS KAKENHI [JP19K04368]

Ask authors/readers for more resources

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.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available