A catalog of self-affine hierarchical entropy functions
Summary: For fixed \(k\) \(\geq 2\) and fixed data alphabet of cardinality \(m\), the hierarchical type class of a data string of length \(n=k^j\) for some \(j\geq\) 1 is formed by permuting the string in all possible ways under permutations arising from the isomorphisms of the unique finite rooted tree of depth \(j\) which has \(n\) leaves and \(k\) children for each non-leaf vertex. Suppose the data strings in a hierarchical type class are losslessly encoded via binary codewords of minimal length. A hierarchical entropy function is a function on the set of \(m\)-dimensional probability distributions which describes the asymptotic compression rate performance of this lossless encoding scheme as the data length \(n\) is allowed to grow without bound. We determine infinitely many hierarchical entropy functions which are each self-affine. For each such function, an explicit iterated function system is found such that the graph of the function is the attractor of the system.
- scientific article; zbMATH DE number 1996079
- Lossy asymptotic equipartition property for hierarchical data structures
- Entropy and optimal compression of some general plane trees
- Asymptotic equipartition properties for simple hierarchical and networked structures
- Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
This page was built for publication: A catalog of self-affine hierarchical entropy functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736493)
