Bayes universal coding algorithm for side information context tree models

Toshiyasu Matsushima, Shigeich Hirasawa

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

    Abstract

    The problem of universal codes with side information is investigated from Bayes criterion. We propose side information context tree models which are an extension of context tree models to sources with side information. Assuming a special class of the prior distributions for side information context tree models, we propose an efficient algorithm of Bayes code for the models. The asymptotic code length of the Bayes codes with side information is also investigated.

    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory - Proceedings
    Pages2345-2348
    Number of pages4
    Volume2005
    DOIs
    Publication statusPublished - 2005
    Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide
    Duration: 2005 Sep 42005 Sep 9

    Other

    Other2005 IEEE International Symposium on Information Theory, ISIT 05
    CityAdelaide
    Period05/9/405/9/9

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    Matsushima, T., & Hirasawa, S. (2005). Bayes universal coding algorithm for side information context tree models. In IEEE International Symposium on Information Theory - Proceedings (Vol. 2005, pp. 2345-2348). [1523767] https://doi.org/10.1109/ISIT.2005.1523767

    Bayes universal coding algorithm for side information context tree models. / Matsushima, Toshiyasu; Hirasawa, Shigeich.

    IEEE International Symposium on Information Theory - Proceedings. Vol. 2005 2005. p. 2345-2348 1523767.

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

    Matsushima, T & Hirasawa, S 2005, Bayes universal coding algorithm for side information context tree models. in IEEE International Symposium on Information Theory - Proceedings. vol. 2005, 1523767, pp. 2345-2348, 2005 IEEE International Symposium on Information Theory, ISIT 05, Adelaide, 05/9/4. https://doi.org/10.1109/ISIT.2005.1523767
    Matsushima T, Hirasawa S. Bayes universal coding algorithm for side information context tree models. In IEEE International Symposium on Information Theory - Proceedings. Vol. 2005. 2005. p. 2345-2348. 1523767 https://doi.org/10.1109/ISIT.2005.1523767
    Matsushima, Toshiyasu ; Hirasawa, Shigeich. / Bayes universal coding algorithm for side information context tree models. IEEE International Symposium on Information Theory - Proceedings. Vol. 2005 2005. pp. 2345-2348
    @inproceedings{70da5b2d4166424ba690e5103e4a2dc6,
    title = "Bayes universal coding algorithm for side information context tree models",
    abstract = "The problem of universal codes with side information is investigated from Bayes criterion. We propose side information context tree models which are an extension of context tree models to sources with side information. Assuming a special class of the prior distributions for side information context tree models, we propose an efficient algorithm of Bayes code for the models. The asymptotic code length of the Bayes codes with side information is also investigated.",
    author = "Toshiyasu Matsushima and Shigeich Hirasawa",
    year = "2005",
    doi = "10.1109/ISIT.2005.1523767",
    language = "English",
    isbn = "0780391519",
    volume = "2005",
    pages = "2345--2348",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",

    }

    TY - GEN

    T1 - Bayes universal coding algorithm for side information context tree models

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeich

    PY - 2005

    Y1 - 2005

    N2 - The problem of universal codes with side information is investigated from Bayes criterion. We propose side information context tree models which are an extension of context tree models to sources with side information. Assuming a special class of the prior distributions for side information context tree models, we propose an efficient algorithm of Bayes code for the models. The asymptotic code length of the Bayes codes with side information is also investigated.

    AB - The problem of universal codes with side information is investigated from Bayes criterion. We propose side information context tree models which are an extension of context tree models to sources with side information. Assuming a special class of the prior distributions for side information context tree models, we propose an efficient algorithm of Bayes code for the models. The asymptotic code length of the Bayes codes with side information is also investigated.

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

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

    U2 - 10.1109/ISIT.2005.1523767

    DO - 10.1109/ISIT.2005.1523767

    M3 - Conference contribution

    AN - SCOPUS:33749453251

    SN - 0780391519

    SN - 9780780391512

    VL - 2005

    SP - 2345

    EP - 2348

    BT - IEEE International Symposium on Information Theory - Proceedings

    ER -