Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability

Ryo Nomura, Hideki Yagi

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

Abstract

The variable-length source coding with unequal cost allowing error probability is considered for general sources. In this setting, the first- and second-order optimum mean codeword cost have already been determined. On the other hand, we focus on the overflow probability of codeword cost and determine the general formulas of the first- and second-order optimum achievable overflow threshold. We also apply our general formulas to the stationary memoryless source.

Original languageEnglish
Title of host publicationProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages364-368
Number of pages5
ISBN (Electronic)9784885523182
DOIs
Publication statusPublished - 2019 Mar 8
Externally publishedYes
Event15th International Symposium on Information Theory and Its Applications, ISITA 2018 - Singapore, Singapore
Duration: 2018 Oct 282018 Oct 31

Publication series

NameProceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

Conference

Conference15th International Symposium on Information Theory and Its Applications, ISITA 2018
CountrySingapore
CitySingapore
Period18/10/2818/10/31

Fingerprint

Costs
Error probability

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems

Cite this

Nomura, R., & Yagi, H. (2019). Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability. In Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018 (pp. 364-368). [8664266] (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.23919/ISITA.2018.8664266

Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability. / Nomura, Ryo; Yagi, Hideki.

Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. Institute of Electrical and Electronics Engineers Inc., 2019. p. 364-368 8664266 (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018).

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

Nomura, R & Yagi, H 2019, Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability. in Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018., 8664266, Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018, Institute of Electrical and Electronics Engineers Inc., pp. 364-368, 15th International Symposium on Information Theory and Its Applications, ISITA 2018, Singapore, Singapore, 18/10/28. https://doi.org/10.23919/ISITA.2018.8664266
Nomura R, Yagi H. Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability. In Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. Institute of Electrical and Electronics Engineers Inc. 2019. p. 364-368. 8664266. (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018). https://doi.org/10.23919/ISITA.2018.8664266
Nomura, Ryo ; Yagi, Hideki. / Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability. Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 364-368 (Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018).
@inproceedings{de335fde60ef4efab23398c88395fe9e,
title = "Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability",
abstract = "The variable-length source coding with unequal cost allowing error probability is considered for general sources. In this setting, the first- and second-order optimum mean codeword cost have already been determined. On the other hand, we focus on the overflow probability of codeword cost and determine the general formulas of the first- and second-order optimum achievable overflow threshold. We also apply our general formulas to the stationary memoryless source.",
author = "Ryo Nomura and Hideki Yagi",
year = "2019",
month = "3",
day = "8",
doi = "10.23919/ISITA.2018.8664266",
language = "English",
series = "Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "364--368",
booktitle = "Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018",

}

TY - GEN

T1 - Overflow Probability of Codeword Cost in Variable-Length Coding Problem Allowing Non-Vanishing Error Probability

AU - Nomura, Ryo

AU - Yagi, Hideki

PY - 2019/3/8

Y1 - 2019/3/8

N2 - The variable-length source coding with unequal cost allowing error probability is considered for general sources. In this setting, the first- and second-order optimum mean codeword cost have already been determined. On the other hand, we focus on the overflow probability of codeword cost and determine the general formulas of the first- and second-order optimum achievable overflow threshold. We also apply our general formulas to the stationary memoryless source.

AB - The variable-length source coding with unequal cost allowing error probability is considered for general sources. In this setting, the first- and second-order optimum mean codeword cost have already been determined. On the other hand, we focus on the overflow probability of codeword cost and determine the general formulas of the first- and second-order optimum achievable overflow threshold. We also apply our general formulas to the stationary memoryless source.

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

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

U2 - 10.23919/ISITA.2018.8664266

DO - 10.23919/ISITA.2018.8664266

M3 - Conference contribution

T3 - Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

SP - 364

EP - 368

BT - Proceedings of 2018 International Symposium on Information Theory and Its Applications, ISITA 2018

PB - Institute of Electrical and Electronics Engineers Inc.

ER -