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 | IEEE International Symposium on Information Theory - Proceedings |
| Pages | 131-135 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - 2010 |
| Event | 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX Duration: 2010 Jun 13 → 2010 Jun 18 |
Other
| Other | 2010 IEEE International Symposium on Information Theory, ISIT 2010 |
|---|---|
| City | Austin, TX |
| Period | 10/6/13 → 10/6/18 |
Fingerprint
ASJC Scopus subject areas
- Applied Mathematics
- Modelling and Simulation
- Theoretical Computer Science
- Information Systems
Cite this
On the overflow probability of lossless codes with side information. / Nomura, Ryo; Matsushima, Toshiyasu.
IEEE International Symposium on Information Theory - Proceedings. 2010. p. 131-135 5513268.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - On the overflow probability of lossless codes with side information
AU - Nomura, Ryo
AU - Matsushima, Toshiyasu
PY - 2010
Y1 - 2010
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
SP - 131
EP - 135
BT - IEEE International Symposium on Information Theory - Proceedings
ER -