A note on the ∈-overflow probability of lossless codes

Ryo Nomura*, Toshiyasu Matsushima, Shigeichi Hirasawa

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

10 Citations (Scopus)


In this letter, 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 e-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 e-achievability of variable-length codes is essentially equivalent to the e-achievability of fixed-length codes for general sources. Moreover by using above results, we show the condition of e-achievability for some restricted sources given ∈.

Original languageEnglish
Pages (from-to)2965-2970
Number of pages6
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number12
Publication statusPublished - 2007 Dec


  • Error probability
  • Fixed-length codes
  • Overflow probability
  • Variable-length codes

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics


Dive into the research topics of 'A note on the ∈-overflow probability of lossless codes'. Together they form a unique fingerprint.

Cite this