On the ∈-overflow probability of lossless codes

Ryo Nomura*, Toshiyasu Matsushima, Shigeichi Hirasawa

*この研究の対応する著者

研究成果: Conference contribution

2 被引用数 (Scopus)

抄録

In this paper, we generalize the achievability of variable-length coding from two viewpoints. One is the definition of an overflow probability, and the other is the definition of an achievability. We define the overflow probability as the probability of codeword length, not per symbol, is larger than ηn and we introduce the ε-achievability of variable-length codes that implies an existence of a code for the source under the condition that the overflow probability is smaller than or equal to ε. Then we show that the ε-achievability of variable-length codes is essentially equivalent to the ε-achievability of fixed-length codes for general sources. Moreover we show the condition of ε-achievability for some restricted sources given ε.

本文言語English
ホスト出版物のタイトルProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
ページ441-445
ページ数5
DOI
出版ステータスPublished - 2007
イベント2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
継続期間: 2007 6 242007 6 29

出版物シリーズ

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

Conference

Conference2007 IEEE International Symposium on Information Theory, ISIT 2007
国/地域France
CityNice
Period07/6/2407/6/29

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • 情報システム
  • モデリングとシミュレーション
  • 応用数学

フィンガープリント

「On the ∈-overflow probability of lossless codes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル