A lower bound on compression of unknown alphabets (2005)

Cached

Download Links

by Nikola Jevtić , Alon Orlitsky , Narayana P. Santhanam
Venue:Theoret. Comput. Sci
Citations:10 - 3 self

Documents Related by Co-Citation

40 A unified approach to weak universal source coding – J C Kieffer - 1978
32 Universal compression of memoryless sources over unknown alphabets – Alon Orlitsky, Narayana P. Santhanam, Junan Zhang - 2004
16 Smeets, “Multialphabet coding with separate alphabet description – J ˚Aberg, Y M Shtarkov, B J M - 1997
12 Universal compression of unknown alphabets – N Jevtić, A Orlitsky, N Santhanam
10 Performance of universal codes over infinite alphabets – A Orlitsky, N P Santhanam - 2003
42 Always Good Turing: Asymptotically optimal probability estimation – A Orlitsky, N Santhanam, J Zhang - 2003
286 Universal coding, information, prediction, and estimation – J Rissanen - 1984
348 Universal codeword sets and representations of the integers – P Elias - 1975
15 Limit results on pattern entropy – A. Orlitsky, N. P. Santhanam, K. Viswanathan, J. Zhang - 2006
15 Speaking of infinity – A Orlitsky, N P Santhanam
125 Universal sequential coding of single messages – Yu M Shtarkov - 1987
91 Universal noiseless coding – L D Davisson - 1973
5 Innovation and pattern entropy of stationary processes – A Orlitsky, N P Santhanam, K Viswanathan, J Zhang
6 Sequential universal lossless techniques for compression of patterns and their description length – G I Shamir
8 on the entropy of patterns of i.i.d. sequences – G I Shamir, “Bounds
6 On the entropy rate of pattern processes – George M. Gemelos, Tsachy Weissman - 2005
4 The Precise Minimax Redundancy – Michael Drmota , Wojciech Szpankowski - 2002
55 Asymptotic minimax regret for data compression, gambling and prediction – Q Xie, A Barron - 2000
85 Universal Portfolios with Side Information – Thomas M. Cover, Erik Ordentlich - 1996