
For FullText PDF, please login, if you are a member of IEICE,
or go to Pay Per View on menu list, if you are a nonmember of IEICE.

On the Overflow Probability of FixedtoVariable Length Codes with Side Information
Ryo NOMURA Toshiyasu MATSUSHIMA
Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Vol.E94A
No.11
pp.20832091 Publication Date: 2011/11/01
Online ISSN: 17451337
DOI: 10.1587/transfun.E94.A.2083
Print ISSN: 09168508 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Source Coding Keyword: overflow probability, side information, achievability,
Full Text: PDF>>
Summary:
The overflow probability is one of criteria that evaluate the performance of fixedtovariable 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 SlepianWolf 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.

