IEICE TRANSACTIONS on Fundamentals
Open Access
An Equivalent Expression for the Wyner-Ziv Source Coding Problem
-
Full Text Views
63
- Cite this
- Free PDF (1MB)
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E105-A No.3 pp.353-362
- Publication Date
- 2022/03/01
- Publicized
- 2021/09/09
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2021TAP0005
- Type of Manuscript
- Special Section PAPER (Special Section on Information Theory and Its Applications)
- Category
- Information Theory
Authors
Tetsunao MATSUTA
Saitama University
Tomohiko UYEMATSU
Tokyo Institute of Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tetsunao MATSUTA, Tomohiko UYEMATSU, "An Equivalent Expression for the Wyner-Ziv Source Coding Problem" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 3, pp. 353-362, March 2022, doi: 10.1587/transfun.2021TAP0005.
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 notions of covering of a set. This allows us to analyze the coding problem in terms of graph coloring and covering.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021TAP0005/_p
Copy
@ARTICLE{e105-a_3_353,
author={Tetsunao MATSUTA, Tomohiko UYEMATSU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Equivalent Expression for the Wyner-Ziv Source Coding Problem},
year={2022},
volume={E105-A},
number={3},
pages={353-362},
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 notions of covering of a set. This allows us to analyze the coding problem in terms of graph coloring and covering.},
keywords={},
doi={10.1587/transfun.2021TAP0005},
ISSN={1745-1337},
month={March},}
Copy
TY - JOUR
TI - An Equivalent Expression for the Wyner-Ziv Source Coding Problem
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 353
EP - 362
AU - Tetsunao MATSUTA
AU - Tomohiko UYEMATSU
PY - 2022
DO - 10.1587/transfun.2021TAP0005
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2022
AB - 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.
ER -
English
