The context-tree weighting method: extensions

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelpeer review

89 Citaten (Scopus)
196 Downloads (Pure)


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
Originele taal-2Engels
Pagina's (van-tot)792-798
Aantal pagina's7
TijdschriftIEEE Transactions on Information Theory
Nummer van het tijdschrift2
StatusGepubliceerd - 1998


Duik in de onderzoeksthema's van 'The context-tree weighting method: extensions'. Samen vormen ze een unieke vingerafdruk.

Citeer dit