Universal codes for finite sequences of integers drawn from a monotone distribution
暂无分享,去创建一个
[1] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[2] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.
[3] László Györfi,et al. There is no universal source code for an infinite source alphabet , 1994, IEEE Trans. Inf. Theory.
[4] László Györfi,et al. On Universal Noiseless Source Coding for Infinite Source Alphabets , 1993, Eur. Trans. Telecommun..
[5] Aaron D. Wyner,et al. An Upper Bound on the Entropy Series , 1972, Inf. Control..
[6] Lee D. Davisson,et al. Universal noiseless coding , 1973, IEEE Trans. Inf. Theory.
[7] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .
[8] Giovanni Manzini,et al. Compression of low entropy strings with Lempel-Ziv algorithms , 1997, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171).
[9] Jossy Sayir. On coding by probability transformation , 1999 .
[10] J. Rissanen. A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH , 1983 .
[11] Neri Merhav,et al. A strong version of the redundancy-capacity theorem of universal coding , 1995, IEEE Trans. Inf. Theory.