By Topic

A zero-redundancy estimator for the context tree weighting method with a finite window

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. M. Rashid ; Dept. of Inf. & Commun. Eng., Univ. of Electro-Commun., Tokyo, Japan ; T. Kawabata

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