Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors

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

    4 Citations (Scopus)

    Abstract

    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.

    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.
    Pages21-25
    Number of pages5
    ISBN (Electronic)9784885523090
    Publication statusPublished - 2017 Feb 2
    Event3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States
    Duration: 2016 Oct 302016 Nov 2

    Other

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

    Fingerprint

    entropy
    Entropy
    Coding errors
    coding
    Error probability

    ASJC Scopus subject areas

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

    Cite this

    Saito, S., & Matsushima, T. (2017). Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016 (pp. 21-25). [7840378] Institute of Electrical and Electronics Engineers Inc..

    Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors. / Saito, Shota; Matsushima, Toshiyasu.

    Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 21-25 7840378.

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

    Saito, S & Matsushima, T 2017, Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors. in Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016., 7840378, Institute of Electrical and Electronics Engineers Inc., pp. 21-25, 3rd International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, United States, 16/10/30.
    Saito S, Matsushima T. Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors. In Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc. 2017. p. 21-25. 7840378
    Saito, Shota ; Matsushima, Toshiyasu. / Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors. Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 21-25
    @inproceedings{1674ce3f5a88499c9156c2160187cbbd,
    title = "Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors",
    abstract = "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.",
    author = "Shota Saito and Toshiyasu Matsushima",
    year = "2017",
    month = "2",
    day = "2",
    language = "English",
    pages = "21--25",
    booktitle = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    address = "United States",

    }

    TY - GEN

    T1 - Threshold of overflow probability in terms of smooth max-entropy for variable-length compression allowing errors

    AU - Saito, Shota

    AU - Matsushima, Toshiyasu

    PY - 2017/2/2

    Y1 - 2017/2/2

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

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

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

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

    M3 - Conference contribution

    AN - SCOPUS:85015213060

    SP - 21

    EP - 25

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

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -