On the overflow probability of lossless codes with side information

Ryo Nomura; Toshiyasu Matsushima

doi:10.1109/ISIT.2010.5513268

On the overflow probability of lossless codes with side information

Ryo Nomura, Toshiyasu Matsushima

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Lossless fixed-to-variable(FV) length codes are considered. The overflow probability is one of criteria that evaluate the performance of FV code. 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. Especially, 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.

Original language	English
Title of host publication	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages	131-135
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2010.5513268
Publication status	Published - 2010 Aug 23
Event	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: 2010 Jun 13 → 2010 Jun 18

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8103

Conference

Conference	2010 IEEE International Symposium on Information Theory, ISIT 2010
Country	United States
City	Austin, TX
Period	10/6/13 → 10/6/18

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2010.5513268

Fingerprint Dive into the research topics of 'On the overflow probability of lossless codes with side information'. Together they form a unique fingerprint.

Cite this

Nomura, R., & Matsushima, T. (2010). On the overflow probability of lossless codes with side information. In 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings (pp. 131-135). [5513268] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2010.5513268

On the overflow probability of lossless codes with side information. / Nomura, Ryo ; Matsushima, Toshiyasu.

2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 131-135 5513268 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nomura, R & Matsushima, T 2010, On the overflow probability of lossless codes with side information. in 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings., 5513268, IEEE International Symposium on Information Theory - Proceedings, pp. 131-135, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 10/6/13. https://doi.org/10.1109/ISIT.2010.5513268

@inproceedings{d2971e8a0d7441b4b5bfd9a8335db424,

title = "On the overflow probability of lossless codes with side information",

abstract = "Lossless fixed-to-variable(FV) length codes are considered. The overflow probability is one of criteria that evaluate the performance of FV code. 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. Especially, 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.",

author = "Ryo Nomura and Toshiyasu Matsushima",

year = "2010",

month = aug,

day = "23",

doi = "10.1109/ISIT.2010.5513268",

language = "English",

isbn = "9781424469604",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "131--135",

booktitle = "2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings",

note = "2010 IEEE International Symposium on Information Theory, ISIT 2010 ; Conference date: 13-06-2010 Through 18-06-2010",

}

TY - GEN

T1 - On the overflow probability of lossless codes with side information

AU - Nomura, Ryo

AU - Matsushima, Toshiyasu

PY - 2010/8/23

Y1 - 2010/8/23

N2 - Lossless fixed-to-variable(FV) length codes are considered. The overflow probability is one of criteria that evaluate the performance of FV code. 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. Especially, 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.

AB - Lossless fixed-to-variable(FV) length codes are considered. The overflow probability is one of criteria that evaluate the performance of FV code. 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. Especially, 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.

UR - http://www.scopus.com/inward/record.url?scp=77955680717&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955680717&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2010.5513268

DO - 10.1109/ISIT.2010.5513268

M3 - Conference contribution

AN - SCOPUS:77955680717

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 131

EP - 135

BT - 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings

T2 - 2010 IEEE International Symposium on Information Theory, ISIT 2010

Y2 - 13 June 2010 through 18 June 2010

ER -