The context-tree weighting method: extensions

Research output: Contribution to journalArticleAcademicpeer-review

89 Citations (Scopus)
187 Downloads (Pure)

Abstract

First we modify the basic (binary) context-tree weighting method such that the past symbols x1-D, x2-D, …, x 0 are not needed by the encoder and the decoder. Then we describe how to make the context-tree depth D infinite, which results in optimal redundancy behavior for all tree sources, while the number of records in the context tree is not larger than 2T-1. Here T is the length of the source sequence. For this extended context-tree weighting algorithm we show that with probability one the compression ratio is not larger than the source entropy for source sequence length T¿8 for stationary and ergodic sources
Original languageEnglish
Pages (from-to)792-798
Number of pages7
JournalIEEE Transactions on Information Theory
Volume44
Issue number2
DOIs
Publication statusPublished - 1998

Fingerprint

Dive into the research topics of 'The context-tree weighting method: extensions'. Together they form a unique fingerprint.

Cite this