Estimating the information content of symbol sequences and efficient codes

By Peter Grassberger. 1989

Subfields: Evaluation & Benchmarks

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Evaluation & Benchmarks

1. Giampaolo Cristadoro
2. Eduardo G. Altmann
3. Mirko Degli Esposti

Citations in the corpus

• On the origin of long-range correlations in texts (2012, methodology): “In the past, different kinds of observables and encodings (which also correspond to particular choices of f ) were used, from the Huffmann code (23), to attributing to each symbol an arbitrary binary sequence (ASCII, unicode, 6-bit tables, dividing letters in groups, etc.”
• Interpretation of the Lempel-Ziv Complexity Measure in the Context of Biomedical Signal Analysis (2006, background): “HE metric of complexity proposed by Lempel and Ziv (LZ) to evaluate the randomness of finite sequences has been extensively used to solve information theoretic problems [1]–[9] and applications such as coding [10]–[12], data compression [13]–[19], and generation of test signals [20]–[22].”