By Topic

Universal estimation of entropy and divergence via block sorting

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

3 Author(s)
Haixiao Cai ; Dept. of Electron. Eng., Princeton Univ., NJ, USA ; S. R. Kulkarni ; S. Verdu

In this paper, we present a new algorithm to estimate both entropy and divergence of two finite-alphabet, finite-memory tree sources, using only information provided by a realization from each of the two sources. Our algorithm outperforms a previous LZ-based method. It is motivated by data compression based on the Burrows-Wheeler block sorting transform, using the fact that if the input is a finite-memory tree source, then the divergence between the output distribution and a piecewise stationary memoryless distribution vanishes as the length of the input sequence goes to infinity.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: