We present a development of parts of rate-distortion theory and pattern-matching algorithms
for lossy data compression, centered around a lossy version of the asymptotic equipartition …

Fifty Years of Shannon Theory Page 1 IEEE TRANSACTIONS ON INFORMATION THEORY,
VOL. 44, NO. 6, OCTOBER 1998 2057 Fifty Years of Shannon Theory Sergio Verdú, Fellow …

A timely book on a topic that has witnessed a surge of interest over the last decade, owing in
part to several novel applications, most notably in data compression and computational …

This book is about finite-alphabet stationary processes, which are important in physics,
engineering, and data compression. The focus is on the combinatorial properties of typical …

We discuss a family of estimators for the entropy rate of a stationary ergodic process and
prove their pointwise and mean consistency under a Doeblin-type mixing condition. The …

First we modify the basic (binary) context-tree weighting method such that the past symbols
x/sub 1-D/, x/sub 2-D/,..., x/sub 0/are not needed by the encoder and the decoder. Then we …

Partly motivated by entropy-estimation problems in neuroscience, we present a detailed and
extensive comparison between some of the most popular and effective entropy estimation …

We compare the compression ratio of the Lempel--Ziv algorithms with the empirical entropy
of the input string. This approach makes it possible to analyze the performance of these …

The Lempel-Ziv parsing scheme finds a wide range of applications, most notably in data
compression and algorithms on words. It partitions a sequence of length n into variable …

We present an approach to searching genetic DNA sequences using an adaptation of the
sufx tree data structure deployed on the general purpose persistent Java platform, PJama …