Abstract :
Summary form only given. Titchener (see Proc. DCC00, IEEE Society Press, p.353-62, 2000, and IEEE-ISIT, , MIT, Boston, August 1998) defined a computable grammar-based entropy measure (T-entropy) for finite strings, Ebeling, Steuer and Titchener (see Stochastics and Dynamics, vol.1, no.1, 2000) and Titchener and Ebeling (see Proc. DCC01, IEEE Society Press, p.520, 2001) demonstrated against the known results for the logistic map, to be a practical way to compute the Shannon information content for data files. A range of binary encodings of the logistic map dynamics have been prepared from a generating bi-partition and with selected normalised entropies, 0.1-1.0 bits/symbol, in steps of 0.1. This corpus of ten test files has been used to evaluate the ´absolute´ performance of a series of popular compressors.
Keywords :
data compression; entropy; Shannon information content; T-entropy; absolute performance; bi-partition; binary encoding; compressor performance; data files; finite strings; grammar-based entropy measure; logistic map; logistic map dynamics; normalised entropies; test files; Entropy; Huffman coding; Logistics; Performance loss; Physics computing; Societies; Stochastic processes; Testing; Time measurement; Trajectory;
