Variable-length coding with cost allowing non-vanishing error probability

Hideki Yagi, Ryo Nomura

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

1 Citation (Scopus)

Abstract

We derive a general formula of the minimum achievable rate for fixed-to-variable length coding with a regular cost function by allowing the error probability up to a constant ϵ. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate with a cost function is also the dominant set for a code attaining the minimum achievable rate with the other cost function. We also give a general formula of the second-order minimum achievable rate.

Original languageEnglish
Title of host publicationProceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages16-20
Number of pages5
ISBN (Electronic)9784885523090
Publication statusPublished - 2017 Feb 2
Externally publishedYes
Event3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
Duration: 2016 Oct 302016 Nov 2

Publication series

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

Other

Other3rd International Symposium on Information Theory and Its Applications, ISITA 2016
CountryUnited States
CityMonterey
Period16/10/3016/11/2

Fingerprint

Cost functions
coding
costs
Costs
Error probability

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Information Systems
  • Signal Processing
  • Library and Information Sciences

Cite this

Yagi, H., & Nomura, R. (2017). Variable-length coding with cost allowing non-vanishing error probability. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 (pp. 16-20). [7840377] (Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016). Institute of Electrical and Electronics Engineers Inc..

Variable-length coding with cost allowing non-vanishing error probability. / Yagi, Hideki; Nomura, Ryo.

Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 16-20 7840377 (Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016).

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

Yagi, H & Nomura, R 2017, Variable-length coding with cost allowing non-vanishing error probability. in Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016., 7840377, Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016, Institute of Electrical and Electronics Engineers Inc., pp. 16-20, 3rd International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, United States, 16/10/30.
Yagi H, Nomura R. Variable-length coding with cost allowing non-vanishing error probability. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 16-20. 7840377. (Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016).
Yagi, Hideki ; Nomura, Ryo. / Variable-length coding with cost allowing non-vanishing error probability. Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 16-20 (Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016).
@inproceedings{114e5dd53d834bbba2f82469ea522edb,
title = "Variable-length coding with cost allowing non-vanishing error probability",
abstract = "We derive a general formula of the minimum achievable rate for fixed-to-variable length coding with a regular cost function by allowing the error probability up to a constant ϵ. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate with a cost function is also the dominant set for a code attaining the minimum achievable rate with the other cost function. We also give a general formula of the second-order minimum achievable rate.",
author = "Hideki Yagi and Ryo Nomura",
year = "2017",
month = "2",
day = "2",
language = "English",
series = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "16--20",
booktitle = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",

}

TY - GEN

T1 - Variable-length coding with cost allowing non-vanishing error probability

AU - Yagi, Hideki

AU - Nomura, Ryo

PY - 2017/2/2

Y1 - 2017/2/2

N2 - We derive a general formula of the minimum achievable rate for fixed-to-variable length coding with a regular cost function by allowing the error probability up to a constant ϵ. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate with a cost function is also the dominant set for a code attaining the minimum achievable rate with the other cost function. We also give a general formula of the second-order minimum achievable rate.

AB - We derive a general formula of the minimum achievable rate for fixed-to-variable length coding with a regular cost function by allowing the error probability up to a constant ϵ. For a fixed-to-variable length code, we call the set of source sequences that can be decoded without error the dominant set of source sequences. For any two regular cost functions, it is revealed that the dominant set of source sequences for a code attaining the minimum achievable rate with a cost function is also the dominant set for a code attaining the minimum achievable rate with the other cost function. We also give a general formula of the second-order minimum achievable rate.

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

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

M3 - Conference contribution

AN - SCOPUS:85015252190

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

SP - 16

EP - 20

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

PB - Institute of Electrical and Electronics Engineers Inc.

ER -