Overflow probability of variable-length codes allowing non-vanishing error probability

Ryo Nomura; Hideki Yagi

doi:10.1109/ITW.2017.8277930

Overflow probability of variable-length codes allowing non-vanishing error probability

Ryo Nomura, Hideki Yagi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

The variable-length coding problem allowing the error probability up to some constant is considered for general sources. In this problem, we focus on the overflow (or excess codeword length) probability We also consider another expression of our general formula so as to reveal the relationship with the optimum coding rate in the fixed-length source coding problem.

Original language	English
Title of host publication	2017 IEEE Information Theory Workshop, ITW 2017
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	589-593
Number of pages	5
ISBN (Electronic)	9781509030972
DOIs	https://doi.org/10.1109/ITW.2017.8277930
Publication status	Published - 2018 Jan 31
Externally published	Yes
Event	2017 IEEE Information Theory Workshop, ITW 2017 - Kaohsiung, Taiwan, Province of China Duration: 2017 Nov 6 → 2017 Nov 10

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
Volume	2018-January
ISSN (Print)	2157-8095

Conference

Conference	2017 IEEE Information Theory Workshop, ITW 2017
Country/Territory	Taiwan, Province of China
City	Kaohsiung
Period	17/11/6 → 17/11/10

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ITW.2017.8277930

Cite this

Overflow probability of variable-length codes allowing non-vanishing error probability. / Nomura, Ryo; Yagi, Hideki.
2017 IEEE Information Theory Workshop, ITW 2017. Institute of Electrical and Electronics Engineers Inc., 2018. p. 589-593 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2018-January).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nomura, R & Yagi, H 2018, Overflow probability of variable-length codes allowing non-vanishing error probability. in 2017 IEEE Information Theory Workshop, ITW 2017. IEEE International Symposium on Information Theory - Proceedings, vol. 2018-January, Institute of Electrical and Electronics Engineers Inc., pp. 589-593, 2017 IEEE Information Theory Workshop, ITW 2017, Kaohsiung, Taiwan, Province of China, 17/11/6. https://doi.org/10.1109/ITW.2017.8277930

@inproceedings{6148e2a010f5439c96916c8fa977055d,

title = "Overflow probability of variable-length codes allowing non-vanishing error probability",

abstract = "The variable-length coding problem allowing the error probability up to some constant is considered for general sources. In this problem, we focus on the overflow (or excess codeword length) probability We also consider another expression of our general formula so as to reveal the relationship with the optimum coding rate in the fixed-length source coding problem.",

author = "Ryo Nomura and Hideki Yagi",

note = "Funding Information: This work was supported in part by JSPS KAKENHI Grant Numbers JP26420371 and JP16K06340. Publisher Copyright: {\textcopyright} 2017 IEEE.; 2017 IEEE Information Theory Workshop, ITW 2017 ; Conference date: 06-11-2017 Through 10-11-2017",

year = "2018",

month = jan,

day = "31",

doi = "10.1109/ITW.2017.8277930",

language = "English",

series = "IEEE International Symposium on Information Theory - Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "589--593",

booktitle = "2017 IEEE Information Theory Workshop, ITW 2017",

}

TY - GEN

T1 - Overflow probability of variable-length codes allowing non-vanishing error probability

AU - Nomura, Ryo

AU - Yagi, Hideki

PY - 2018/1/31

Y1 - 2018/1/31

N2 - The variable-length coding problem allowing the error probability up to some constant is considered for general sources. In this problem, we focus on the overflow (or excess codeword length) probability We also consider another expression of our general formula so as to reveal the relationship with the optimum coding rate in the fixed-length source coding problem.

AB - The variable-length coding problem allowing the error probability up to some constant is considered for general sources. In this problem, we focus on the overflow (or excess codeword length) probability We also consider another expression of our general formula so as to reveal the relationship with the optimum coding rate in the fixed-length source coding problem.

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

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

U2 - 10.1109/ITW.2017.8277930

DO - 10.1109/ITW.2017.8277930

M3 - Conference contribution

AN - SCOPUS:85046349517

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 589

EP - 593

BT - 2017 IEEE Information Theory Workshop, ITW 2017

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2017 IEEE Information Theory Workshop, ITW 2017

Y2 - 6 November 2017 through 10 November 2017

ER -

Overflow probability of variable-length codes allowing non-vanishing error probability

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this