This paper deals with one-shot fixed-to-variable length source coding allowing error probability. We adopt the criterion of the overflow probability and treat prefix and non-prefix codes. The infimum of the threshold of the overflow probability is investigated under the condition that the error probability and the overflow probability are bounded above by positive constants. We show this threshold is evaluated in terms of the smooth max-entropy and clarify the difference of the thresholds between prefix and non-prefix codes. Further, we elucidate the benefit of allowing a nonzero error compared with lossless coding.
|Title of host publication
|Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
|Institute of Electrical and Electronics Engineers Inc.
|Number of pages
|Published - 2017 Feb 2
|3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
Duration: 2016 Oct 30 → 2016 Nov 2
|3rd International Symposium on Information Theory and Its Applications, ISITA 2016
|16/10/30 → 16/11/2
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture
- Information Systems
- Signal Processing
- Library and Information Sciences