DocumentCode
2050643
Title
Average case universal lossless compression with unknown alphabets
Author
Shamir, Gil I.
Author_Institution
Electr. & Comput. Eng., Utah Univ., Salt Lake City, UT, USA
fYear
2004
fDate
27 June-2 July 2004
Firstpage
27
Abstract
Bounds on the average redundancy are derived for universal coding of patterns of sequences generated by independently identically distributed (i.i.d.) sources with unknown, possibly large, alphabets. Sequential approached for compression of patterns are proposed, and the relation between pattern entropy and that of i.i.d. sequences is studied.
Keywords
probability; source coding; independently identically distributed source; pattern entropy; sequence pattern; universal coding; Cities and towns; Computer aided software engineering; Costs; Distributed power generation; Entropy; Gas insulated transmission lines; Minimax techniques; Statistical distributions;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365062
Filename
1365062
Link To Document