Title :
Another look at universal data compression
Author :
Ziv, Jacob ; Hershkovitz, Yehuda
Author_Institution :
Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel
fDate :
27 Jun-1 Jul 1994
Abstract :
Non-asymptotic coding and converse theorems are derived for universal data-compression algorithms in cases where the training sequence (“history”) that is available to the encoder is not large enough so as to yield the ultimate compression ratio, namely the entropy of the source
Keywords :
binary sequences; data compression; entropy; source coding; binary sequence; compression ratio; converse theorems; encoder; non-asymptotic coding; source coding; training sequence; universal data-compression algorithms; Binary sequences; Data compression; Encoding; Entropy; H infinity control; Jacobian matrices; Statistics;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394960
