Bayes coding algorithm for FSM sources

Toshiyasu Matsushima, Shigeichi Hirasawa

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

    5 Citations (Scopus)

    Abstract

    The optimal universal code for FSMX sources (Rissanen, 1981) with respect to Bayes redundancy criterion (Davison, 1973) is deduced under the condition that the model, the probabilistic parameters, and the initial state are unknown. The algorithm is not only Bayes optimal for FSMX sources but also asymptotically optimal for a stationary ergodic sources. Further, the algorithm is regarded as a generalization of the Ziv-Lempel algorithm. In the basic CTW algorithm, the algorithm needs an initial context, where a finite constant is the depth of the context tree, for calculating the coding probability. For the problems of the initial situation and the infinite depth tree, the extensions to the CTW algorithm have been proposed in a paper by Willems (1994). In this paper, an optimal algorithm is proposed that gives solution against these problems from new point of view. This proposed method is also regarded as a generalization of the Ziv-Lempel algorithm.

    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory - Proceedings
    Place of PublicationPiscataway, NJ, United States
    PublisherIEEE
    Pages388
    Number of pages1
    Publication statusPublished - 1995
    EventProceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can
    Duration: 1995 Sep 171995 Sep 22

    Other

    OtherProceedings of the 1995 IEEE International Symposium on Information Theory
    CityWhistler, BC, Can
    Period95/9/1795/9/22

    Fingerprint

    Bayes
    Coding
    Asymptotically Optimal
    Trees (mathematics)
    Optimal Algorithm
    Redundancy
    Unknown

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Applied Mathematics
    • Modelling and Simulation
    • Theoretical Computer Science
    • Information Systems

    Cite this

    Matsushima, T., & Hirasawa, S. (1995). Bayes coding algorithm for FSM sources. In IEEE International Symposium on Information Theory - Proceedings (pp. 388). Piscataway, NJ, United States: IEEE.

    Bayes coding algorithm for FSM sources. / Matsushima, Toshiyasu; Hirasawa, Shigeichi.

    IEEE International Symposium on Information Theory - Proceedings. Piscataway, NJ, United States : IEEE, 1995. p. 388.

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

    Matsushima, T & Hirasawa, S 1995, Bayes coding algorithm for FSM sources. in IEEE International Symposium on Information Theory - Proceedings. IEEE, Piscataway, NJ, United States, pp. 388, Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, BC, Can, 95/9/17.
    Matsushima T, Hirasawa S. Bayes coding algorithm for FSM sources. In IEEE International Symposium on Information Theory - Proceedings. Piscataway, NJ, United States: IEEE. 1995. p. 388
    Matsushima, Toshiyasu ; Hirasawa, Shigeichi. / Bayes coding algorithm for FSM sources. IEEE International Symposium on Information Theory - Proceedings. Piscataway, NJ, United States : IEEE, 1995. pp. 388
    @inproceedings{af9669a9eea644af9e87866d9bb09a7f,
    title = "Bayes coding algorithm for FSM sources",
    abstract = "The optimal universal code for FSMX sources (Rissanen, 1981) with respect to Bayes redundancy criterion (Davison, 1973) is deduced under the condition that the model, the probabilistic parameters, and the initial state are unknown. The algorithm is not only Bayes optimal for FSMX sources but also asymptotically optimal for a stationary ergodic sources. Further, the algorithm is regarded as a generalization of the Ziv-Lempel algorithm. In the basic CTW algorithm, the algorithm needs an initial context, where a finite constant is the depth of the context tree, for calculating the coding probability. For the problems of the initial situation and the infinite depth tree, the extensions to the CTW algorithm have been proposed in a paper by Willems (1994). In this paper, an optimal algorithm is proposed that gives solution against these problems from new point of view. This proposed method is also regarded as a generalization of the Ziv-Lempel algorithm.",
    author = "Toshiyasu Matsushima and Shigeichi Hirasawa",
    year = "1995",
    language = "English",
    pages = "388",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",
    publisher = "IEEE",

    }

    TY - GEN

    T1 - Bayes coding algorithm for FSM sources

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeichi

    PY - 1995

    Y1 - 1995

    N2 - The optimal universal code for FSMX sources (Rissanen, 1981) with respect to Bayes redundancy criterion (Davison, 1973) is deduced under the condition that the model, the probabilistic parameters, and the initial state are unknown. The algorithm is not only Bayes optimal for FSMX sources but also asymptotically optimal for a stationary ergodic sources. Further, the algorithm is regarded as a generalization of the Ziv-Lempel algorithm. In the basic CTW algorithm, the algorithm needs an initial context, where a finite constant is the depth of the context tree, for calculating the coding probability. For the problems of the initial situation and the infinite depth tree, the extensions to the CTW algorithm have been proposed in a paper by Willems (1994). In this paper, an optimal algorithm is proposed that gives solution against these problems from new point of view. This proposed method is also regarded as a generalization of the Ziv-Lempel algorithm.

    AB - The optimal universal code for FSMX sources (Rissanen, 1981) with respect to Bayes redundancy criterion (Davison, 1973) is deduced under the condition that the model, the probabilistic parameters, and the initial state are unknown. The algorithm is not only Bayes optimal for FSMX sources but also asymptotically optimal for a stationary ergodic sources. Further, the algorithm is regarded as a generalization of the Ziv-Lempel algorithm. In the basic CTW algorithm, the algorithm needs an initial context, where a finite constant is the depth of the context tree, for calculating the coding probability. For the problems of the initial situation and the infinite depth tree, the extensions to the CTW algorithm have been proposed in a paper by Willems (1994). In this paper, an optimal algorithm is proposed that gives solution against these problems from new point of view. This proposed method is also regarded as a generalization of the Ziv-Lempel algorithm.

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

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

    M3 - Conference contribution

    SP - 388

    BT - IEEE International Symposium on Information Theory - Proceedings

    PB - IEEE

    CY - Piscataway, NJ, United States

    ER -