Average case universal lossless compression with unknown alphabets
Gil I. Shamir · 2004
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.