On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information

Ryo NOMURA; Toshiyasu MATSUSHIMA

doi:10.1587/transfun.E94.A.2083

On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information

Ryo NOMURA, Toshiyasu MATSUSHIMA

Full Text Views

0

Cite this

Summary :

The overflow probability is one of criteria that evaluate the performance of fixed-to-variable length (FV) codes. In the single source coding problem, there were many researches on the overflow probability. Recently, the source coding problem for correlated sources, such as Slepian-Wolf coding problem or source coding problem with side information, is one of main topics in information theory. In this paper, we consider the source coding problem with side information. In particular, we consider the FV code in the case that the encoder and the decoder can see side information. In this case, several codes were proposed and their mean code lengths were analyzed. However, there was no research about the overflow probability. We shall show two lemmas about the overflow probability. Then we obtain the condition that there exists a FV code under the condition that the overflow probability is smaller than or equal to some constant.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E94-A No.11 pp.2083-2091

Publication Date: 2011/11/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1587/transfun.E94.A.2083

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Source Coding

Cite this

Copy

Ryo NOMURA, Toshiyasu MATSUSHIMA, "On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information" in IEICE TRANSACTIONS on Fundamentals, vol. E94-A, no. 11, pp. 2083-2091, November 2011, doi: 10.1587/transfun.E94.A.2083.
Abstract: The overflow probability is one of criteria that evaluate the performance of fixed-to-variable length (FV) codes. In the single source coding problem, there were many researches on the overflow probability. Recently, the source coding problem for correlated sources, such as Slepian-Wolf coding problem or source coding problem with side information, is one of main topics in information theory. In this paper, we consider the source coding problem with side information. In particular, we consider the FV code in the case that the encoder and the decoder can see side information. In this case, several codes were proposed and their mean code lengths were analyzed. However, there was no research about the overflow probability. We shall show two lemmas about the overflow probability. Then we obtain the condition that there exists a FV code under the condition that the overflow probability is smaller than or equal to some constant.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E94.A.2083/_p

Copy

@ARTICLE{e94-a_11_2083,
author={Ryo NOMURA, Toshiyasu MATSUSHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information},
year={2011},
volume={E94-A},
number={11},
pages={2083-2091},
abstract={The overflow probability is one of criteria that evaluate the performance of fixed-to-variable length (FV) codes. In the single source coding problem, there were many researches on the overflow probability. Recently, the source coding problem for correlated sources, such as Slepian-Wolf coding problem or source coding problem with side information, is one of main topics in information theory. In this paper, we consider the source coding problem with side information. In particular, we consider the FV code in the case that the encoder and the decoder can see side information. In this case, several codes were proposed and their mean code lengths were analyzed. However, there was no research about the overflow probability. We shall show two lemmas about the overflow probability. Then we obtain the condition that there exists a FV code under the condition that the overflow probability is smaller than or equal to some constant.},
keywords={},
doi={10.1587/transfun.E94.A.2083},
ISSN={1745-1337},
month={November},}

Copy

TY - JOUR
TI - On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2083
EP - 2091
AU - Ryo NOMURA
AU - Toshiyasu MATSUSHIMA
PY - 2011
DO - 10.1587/transfun.E94.A.2083
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E94-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2011
AB - The overflow probability is one of criteria that evaluate the performance of fixed-to-variable length (FV) codes. In the single source coding problem, there were many researches on the overflow probability. Recently, the source coding problem for correlated sources, such as Slepian-Wolf coding problem or source coding problem with side information, is one of main topics in information theory. In this paper, we consider the source coding problem with side information. In particular, we consider the FV code in the case that the encoder and the decoder can see side information. In this case, several codes were proposed and their mean code lengths were analyzed. However, there was no research about the overflow probability. We shall show two lemmas about the overflow probability. Then we obtain the condition that there exists a FV code under the condition that the overflow probability is smaller than or equal to some constant.
ER -