A modification of the finite window context tree weighting (FWCTW) [H. Sakaguti, et al., 1997] lossless data compression algorithm is considered. First, we give an exposition of the basic framework of FWCTW. Next, we propose a zero-redundancy estimator for FWCTW and verify that our estimator, which is computed with finite precision actually encodes and decodes the data sequence.
Published in:
Information Theory, 2003. Proceedings. IEEE International Symposium on
Date of Conference: 29 June-4 July 2003