By Topic

Universal compression of unknown alphabets

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jevtic, N. ; Dept. of Electr. & Comput. Eng., Univ. of California, La Jolla, CA, USA ; Orlitsky, A. ; Santhanam, N.

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.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference:

2002