Title :
Universal compression of unknown alphabets
Author :
JevtiC, Nikola ; Orlitsky, Alon ; Santhanam, Narayana
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of California, La Jolla, CA, USA
Abstract :
We consider universal compression of strings where the symbols are drawn independently according to the same unknown distribution over an unknown alphabet. We show that the order of the symbols can be conveyed using essentially as many bits as needed when the distribution is known in advance.
Keywords :
data compression; probability; source coding; data compression; probability distibution; source distribution; strings; universal compression; unknown alphabets; Data compression; Facsimile; Minimax techniques; Probability distribution;
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
DOI :
10.1109/ISIT.2002.1023592
