On Asymptotics Of Certain Recurrences Arising In Universal Coding (1997)

by Wojciech Szpankowski
Venue:Problems of Information Transmission
Citations:14 - 4 self

Documents Related by Co-Citation

55 Asymptotic minimax regret for data compression, gambling, and prediction – Q Xie, A R Barron - 1996
40 A unified approach to weak universal source coding – J C Kieffer
90 Universal noiseless coding – L D Davisson - 1973
33 Precise Minimax Redundancy and Regret – Michael Drmota, Wojciech Szpankowski - 2004
275 Fisher information and stochastic complexity – J Rissanen - 1996
125 Universal Sequential Coding of Single Messages – Y M Shtar‘kov - 1987
150 Universal Portfolios – Thomas M. Cover - 1996
16 Redundancy rates for renewal and other processes – I Csiszár, P Shields - 1996
348 Universal codeword sets and representations of the integers – P Elias - 1975
32 Universal compression of memoryless sources over unknown alphabets – Alon Orlitsky, Narayana P. Santhanam, Junan Zhang - 2004
214 Average Case Analysis of Algorithms on Sequences – W Szpankowski - 2001
128 The performance of universal encoding – R E Krichevsky, V K Trohov - 1981
24 Uniform redundancy rates do not exist – P C Shields - 1993
15 Speaking of infinity – A Orlitsky, N P Santhanam
11 Universal lossless compression with unknown alphabets -- The average case – Gil I. Shamir - 2006
4 The Precise Minimax Redundancy – Michael Drmota , Wojciech Szpankowski - 2002
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
42 Always Good Turing: Asymptotically optimal probability estimation – A Orlitsky, N Santhanam, J Zhang - 2003