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

41 A unified approach to weak universal source coding – J C Kieffer - 1978
35 Universal compression of memoryless sources over unknown alphabets – Alon Orlitsky, Narayana P. Santhanam, Junan Zhang - 2004
357 University codeword sets and representation of the integers – P Elias - 1975
296 Universal coding, information, prediction and estimation – J Rissanen - 1984
18 Multialphabet coding with separate alphabet description, in – J ˚Aberg, Y M Shtarkov, B J M Smeets - 1997
940 An Empirical Study of Smoothing Techniques for Language Modeling – Stanley F. Chen - 1998
45 Always good turing: asymptotically optimal probability estimation, Science 302 (5644 – A Orlitsky, N P Santhanam, J Zhang - 2003
921 Information Theory: Coding Theorems for Discrete Memoryless Systems – I Csiszár, J Körner - 1981
1711 An Introduction to Probability Theory – W FELLER - 1968