Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources

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

    3 Citations (Scopus)

    Abstract

    This paper considers universal lossless variable-length source coding problem and deals with one of the fundamental limits and pointwise asymptotics of the Bayes code for stationary ergodic finite order Markov sources. As investigation of the fundamental limits, we show upper and lower bounds of the minimum rate such that the probability which exceeds it is less than ϵ ϵ (0, 1). Furthermore, we prove that the codeword length ovf the Bayes code satisfies the asymptotic normality (pointwise equation asymptotics) and the law of the iterated logarithm (pointwise equation asymptotics), where n represents length of a source sequence and 'log' is the natural logarithm.

    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory - Proceedings
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages1986-1990
    Number of pages5
    Volume2015-June
    ISBN (Print)9781467377041
    DOIs
    Publication statusPublished - 2015 Sep 28
    EventIEEE International Symposium on Information Theory, ISIT 2015 - Hong Kong, Hong Kong
    Duration: 2015 Jun 142015 Jun 19

    Other

    OtherIEEE International Symposium on Information Theory, ISIT 2015
    CountryHong Kong
    CityHong Kong
    Period15/6/1415/6/19

    Fingerprint

    Bayes
    Natural logarithm
    Source Coding
    Law of the Iterated Logarithm
    Asymptotic Normality
    Upper and Lower Bounds
    Exceed

    ASJC Scopus subject areas

    • Applied Mathematics
    • Modelling and Simulation
    • Theoretical Computer Science
    • Information Systems

    Cite this

    Saito, S., Miya, N., & Matsushima, T. (2015). Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources. In IEEE International Symposium on Information Theory - Proceedings (Vol. 2015-June, pp. 1986-1990). [7282803] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2015.7282803

    Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources. / Saito, Shota; Miya, Nozomi; Matsushima, Toshiyasu.

    IEEE International Symposium on Information Theory - Proceedings. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. p. 1986-1990 7282803.

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

    Saito, S, Miya, N & Matsushima, T 2015, Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources. in IEEE International Symposium on Information Theory - Proceedings. vol. 2015-June, 7282803, Institute of Electrical and Electronics Engineers Inc., pp. 1986-1990, IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, Hong Kong, 15/6/14. https://doi.org/10.1109/ISIT.2015.7282803
    Saito S, Miya N, Matsushima T. Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources. In IEEE International Symposium on Information Theory - Proceedings. Vol. 2015-June. Institute of Electrical and Electronics Engineers Inc. 2015. p. 1986-1990. 7282803 https://doi.org/10.1109/ISIT.2015.7282803
    Saito, Shota ; Miya, Nozomi ; Matsushima, Toshiyasu. / Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources. IEEE International Symposium on Information Theory - Proceedings. Vol. 2015-June Institute of Electrical and Electronics Engineers Inc., 2015. pp. 1986-1990
    @inproceedings{626fa78c0559401aa362f60593898514,
    title = "Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources",
    abstract = "This paper considers universal lossless variable-length source coding problem and deals with one of the fundamental limits and pointwise asymptotics of the Bayes code for stationary ergodic finite order Markov sources. As investigation of the fundamental limits, we show upper and lower bounds of the minimum rate such that the probability which exceeds it is less than ϵ ϵ (0, 1). Furthermore, we prove that the codeword length ovf the Bayes code satisfies the asymptotic normality (pointwise equation asymptotics) and the law of the iterated logarithm (pointwise equation asymptotics), where n represents length of a source sequence and 'log' is the natural logarithm.",
    author = "Shota Saito and Nozomi Miya and Toshiyasu Matsushima",
    year = "2015",
    month = "9",
    day = "28",
    doi = "10.1109/ISIT.2015.7282803",
    language = "English",
    isbn = "9781467377041",
    volume = "2015-June",
    pages = "1986--1990",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",

    }

    TY - GEN

    T1 - Fundamental limit and pointwise asymptotics of the Bayes code for Markov sources

    AU - Saito, Shota

    AU - Miya, Nozomi

    AU - Matsushima, Toshiyasu

    PY - 2015/9/28

    Y1 - 2015/9/28

    N2 - This paper considers universal lossless variable-length source coding problem and deals with one of the fundamental limits and pointwise asymptotics of the Bayes code for stationary ergodic finite order Markov sources. As investigation of the fundamental limits, we show upper and lower bounds of the minimum rate such that the probability which exceeds it is less than ϵ ϵ (0, 1). Furthermore, we prove that the codeword length ovf the Bayes code satisfies the asymptotic normality (pointwise equation asymptotics) and the law of the iterated logarithm (pointwise equation asymptotics), where n represents length of a source sequence and 'log' is the natural logarithm.

    AB - This paper considers universal lossless variable-length source coding problem and deals with one of the fundamental limits and pointwise asymptotics of the Bayes code for stationary ergodic finite order Markov sources. As investigation of the fundamental limits, we show upper and lower bounds of the minimum rate such that the probability which exceeds it is less than ϵ ϵ (0, 1). Furthermore, we prove that the codeword length ovf the Bayes code satisfies the asymptotic normality (pointwise equation asymptotics) and the law of the iterated logarithm (pointwise equation asymptotics), where n represents length of a source sequence and 'log' is the natural logarithm.

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

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

    U2 - 10.1109/ISIT.2015.7282803

    DO - 10.1109/ISIT.2015.7282803

    M3 - Conference contribution

    AN - SCOPUS:84969801339

    SN - 9781467377041

    VL - 2015-June

    SP - 1986

    EP - 1990

    BT - IEEE International Symposium on Information Theory - Proceedings

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -