DocumentCode :
3059858
Title :
On the overflow probability of lossless codes with side information
Author :
Nomura, Ryo ; Matsushima, Toshiyasu
Author_Institution :
Sch. of Network & Inf., Senshu Univ., Japan
fYear :
2010
fDate :
13-18 June 2010
Firstpage :
131
Lastpage :
135
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.
Keywords :
probability; source coding; variable length codes; Slepian-Wolf coding problem; decoder; encoder; lossless fixed-to-variable length codes; overflow probability; side information; single source coding problem; Abstracts; Ad hoc networks; Capacity planning; Chromium; Cognitive radio; Interference; Mobile ad hoc networks; Performance analysis; Radio transmitters; Receivers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-7890-3
Electronic_ISBN :
978-1-4244-7891-0
Type :
conf
DOI :
10.1109/ISIT.2010.5513268
Filename :
5513268
Link To Document :
بازگشت