A Bayes coding algorithm using context tree

Toshiyasu Matsushima; Shigeichi Hirasawa

doi:10.1109/ISIT.1994.394633

A Bayes coding algorithm using context tree

Toshiyasu Matsushima, Shigeichi Hirasawa

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources. The present authors propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. This algorithm can be applied to a wide class of prior distribution for finite alphabet FSMX sources. The algorithm is regarded as both a generalized version of the CTW procedure and a practical algorithm using a context tree of the adaptive Bayes coding which has been studied in Mataushima et al. (1991). Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.

Original language	English
Title of host publication	Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994
Number of pages	1
DOIs	https://doi.org/10.1109/ISIT.1994.394633
Publication status	Published - 1994 Dec 1
Event	1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim, Norway Duration: 1994 Jun 27 → 1994 Jul 1

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8095

Conference

Conference	1994 IEEE International Symposium on Information Theory, ISIT 1994
Country/Territory	Norway
City	Trondheim
Period	94/6/27 → 94/7/1

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modelling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.1994.394633

Cite this

Matsushima, T & Hirasawa, S 1994, A Bayes coding algorithm using context tree. in Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994., 394633, IEEE International Symposium on Information Theory - Proceedings, 1994 IEEE International Symposium on Information Theory, ISIT 1994, Trondheim, Norway, 94/6/27. https://doi.org/10.1109/ISIT.1994.394633

@inproceedings{304b4eef71b94d75a36f245f4ac26d0f,

title = "A Bayes coding algorithm using context tree",

abstract = "The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources. The present authors propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. This algorithm can be applied to a wide class of prior distribution for finite alphabet FSMX sources. The algorithm is regarded as both a generalized version of the CTW procedure and a practical algorithm using a context tree of the adaptive Bayes coding which has been studied in Mataushima et al. (1991). Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.",

author = "Toshiyasu Matsushima and Shigeichi Hirasawa",

year = "1994",

month = dec,

day = "1",

doi = "10.1109/ISIT.1994.394633",

language = "English",

isbn = "0780320158",

series = "IEEE International Symposium on Information Theory - Proceedings",

booktitle = "Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994",

note = "1994 IEEE International Symposium on Information Theory, ISIT 1994 ; Conference date: 27-06-1994 Through 01-07-1994",

}

TY - GEN

T1 - A Bayes coding algorithm using context tree

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 1994/12/1

Y1 - 1994/12/1

N2 - The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources. The present authors propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. This algorithm can be applied to a wide class of prior distribution for finite alphabet FSMX sources. The algorithm is regarded as both a generalized version of the CTW procedure and a practical algorithm using a context tree of the adaptive Bayes coding which has been studied in Mataushima et al. (1991). Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.

AB - The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources. The present authors propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. This algorithm can be applied to a wide class of prior distribution for finite alphabet FSMX sources. The algorithm is regarded as both a generalized version of the CTW procedure and a practical algorithm using a context tree of the adaptive Bayes coding which has been studied in Mataushima et al. (1991). Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.

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

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

U2 - 10.1109/ISIT.1994.394633

DO - 10.1109/ISIT.1994.394633

M3 - Conference contribution

AN - SCOPUS:84894291840

SN - 0780320158

SN - 9780780320154

T3 - IEEE International Symposium on Information Theory - Proceedings

BT - Proceedings - 1994 IEEE International Symposium on Information Theory, ISIT 1994

T2 - 1994 IEEE International Symposium on Information Theory, ISIT 1994

Y2 - 27 June 1994 through 1 July 1994

ER -

A Bayes coding algorithm using context tree

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this