DocumentCode :
2729568
Title :
On the compression dimension of data strings and data sets
Author :
Kieffer, John ; Nelson, Greg
Author_Institution :
Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA
fYear :
1995
fDate :
17-22 Sep 1995
Firstpage :
267
Abstract :
A hierarchical lossless source code compresses data by means of a graph used to represent the data. We show that the hierarchical codes which perform best as the number of data samples grows have a compression performance that can be characterized via a notion of the dimension of the data which we call the compression dimension
Keywords :
codes; data compression; data structures; graph theory; source coding; compression dimension; compression performance; data compression; data representation; data samples; data sets; data strings; graph; hierarchical codes; hierarchical lossless source code; Conferences; Data compression; Societies;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location :
Whistler, BC
Print_ISBN :
0-7803-2453-6
Type :
conf
DOI :
10.1109/ISIT.1995.535782
Filename :
535782
Link To Document :
بازگشت