On the compression dimension of data strings and data sets

摘要

A hierarchical lossless source code compresses data by means of agraph used to represent the data. We show that the hierarchical codeswhich perform best as the number of data samples grows have acompression performance that can be characterized via a notion of thedimension of the data which we call the compression dimension