On the overflow probability of lossless codes with side information

研究成果: Conference contribution

抜粋

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.

元の言語English
ホスト出版物のタイトル2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
ページ131-135
ページ数5
DOI
出版物ステータスPublished - 2010 8 23
イベント2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
継続期間: 2010 6 132010 6 18

出版物シリーズ

名前IEEE International Symposium on Information Theory - Proceedings
ISSN(印刷物)2157-8103

Conference

Conference2010 IEEE International Symposium on Information Theory, ISIT 2010
United States
Austin, TX
期間10/6/1310/6/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

フィンガープリント On the overflow probability of lossless codes with side information' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Nomura, R., & Matsushima, T. (2010). On the overflow probability of lossless codes with side information. : 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