Universal coding of Zipf distributions

[1] ABERG J, 1997, P COMPR COMPL SEQ

[2] Predicting a binary sequence almost as well as the optimal biased coin [J]. INFORMATION AND COMPUTATION, 2003, 182 (02) : 73 - 94

[3] JEVTIC N, 2002, IEEE S INF THEOR

[4] THE PERFORMANCE OF UNIVERSAL ENCODING [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (02) : 199 - 207

[5] ORLITSKY A, 2003, IEEE S INF THEOR

[6] Zipf G., 1932, Selective studies and the principle of relative frequency in language

[1] ABERG J, 1997, P COMPR COMPL SEQ

[2] Predicting a binary sequence almost as well as the optimal biased coin [J]. INFORMATION AND COMPUTATION, 2003, 182 (02) : 73 - 94

[3] JEVTIC N, 2002, IEEE S INF THEOR

[4] THE PERFORMANCE OF UNIVERSAL ENCODING [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1981, 27 (02) : 199 - 207

[5] ORLITSKY A, 2003, IEEE S INF THEOR

[6] Zipf G., 1932, Selective studies and the principle of relative frequency in language