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 -