On the ∈-overflow probability of lossless codes

Ryo Nomura, Toshiyasu Matsushima, Shigeichi Hirasawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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 ε.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages441-445
Number of pages5
DOIs
Publication statusPublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice
Duration: 2007 Jun 242007 Jun 29

Other

Other2007 IEEE International Symposium on Information Theory, ISIT 2007
CityNice
Period07/6/2407/6/29

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Nomura, R., Matsushima, T., & Hirasawa, S. (2007). On the ∈-overflow probability of lossless codes. In IEEE International Symposium on Information Theory - Proceedings (pp. 441-445). [4557265] https://doi.org/10.1109/ISIT.2007.4557265

On the ∈-overflow probability of lossless codes. / Nomura, Ryo; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

IEEE International Symposium on Information Theory - Proceedings. 2007. p. 441-445 4557265.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nomura, R, Matsushima, T & Hirasawa, S 2007, On the ∈-overflow probability of lossless codes. in IEEE International Symposium on Information Theory - Proceedings., 4557265, pp. 441-445, 2007 IEEE International Symposium on Information Theory, ISIT 2007, Nice, 07/6/24. https://doi.org/10.1109/ISIT.2007.4557265
Nomura R, Matsushima T, Hirasawa S. On the ∈-overflow probability of lossless codes. In IEEE International Symposium on Information Theory - Proceedings. 2007. p. 441-445. 4557265 https://doi.org/10.1109/ISIT.2007.4557265
Nomura, Ryo ; Matsushima, Toshiyasu ; Hirasawa, Shigeichi. / On the ∈-overflow probability of lossless codes. IEEE International Symposium on Information Theory - Proceedings. 2007. pp. 441-445
@inproceedings{61a9059f39b74ba8bd30e24fe98cc340,
title = "On the ∈-overflow probability of lossless codes",
abstract = "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 ε.",
author = "Ryo Nomura and Toshiyasu Matsushima and Shigeichi Hirasawa",
year = "2007",
doi = "10.1109/ISIT.2007.4557265",
language = "English",
isbn = "1424414296",
pages = "441--445",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - On the ∈-overflow probability of lossless codes

AU - Nomura, Ryo

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2007

Y1 - 2007

N2 - 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 ε.

AB - 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 ε.

UR - http://www.scopus.com/inward/record.url?scp=51649107856&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=51649107856&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2007.4557265

DO - 10.1109/ISIT.2007.4557265

M3 - Conference contribution

AN - SCOPUS:51649107856

SN - 1424414296

SN - 9781424414291

SP - 441

EP - 445

BT - IEEE International Symposium on Information Theory - Proceedings

ER -