摘要: By taking into account the Fisher information and removing an inherent redundancy in earlier two-part codes, a sharper code length as the stochastic complexity and the associated …
acm.org
sci-hub.se 参考文章(15)
Jorma Rissanen, Noise Separation and MDL Modeling of Chaotic Processes Springer, Dordrecht. pp. 317- 330 ,(1994) , 10.1007/978-94-011-1068-6_21
Jorma Rissanen, Stochastic Complexity and Modeling Annals of Statistics. ,vol. 14, pp. 1080- 1100 ,(1986) , 10.1214/AOS/1176350051
R. Krichevsky, V. Trofimov, The performance of universal encoding IEEE Transactions on Information Theory. ,vol. 27, pp. 199- 207 ,(1981) , 10.1109/TIT.1981.1056331
Bertrand S Clarke, Andrew R Barron, None, Jeffreys' prior is asymptotically least favorable under entropy risk Journal of Statistical Planning and Inference. ,vol. 41, pp. 37- 60 ,(1994) , 10.1016/0378-3758(94)90153-8
B. Ryabko, Comments on "A source matching approach to finding minimax codes" by Davisson, L. D. and Leon-Garcia, A. IEEE Transactions on Information Theory. ,vol. 27, pp. 780- 781 ,(1981) , 10.1109/TIT.1981.1056409
L. Davisson, Minimax noiseless universal coding for Markov sources IEEE Transactions on Information Theory. ,vol. 29, pp. 211- 215 ,(1983) , 10.1109/TIT.1983.1056652
M.J. Weinberger, J.J. Rissanen, M. Feder, A universal finite memory source IEEE Transactions on Information Theory. ,vol. 41, pp. 643- 652 ,(1995) , 10.1109/18.382011
Jorma Rissanen, A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH Annals of Statistics. ,vol. 11, pp. 416- 431 ,(1983) , 10.1214/AOS/1176346150
P. Elias, Universal codeword sets and representations of the integers IEEE Transactions on Information Theory. ,vol. 21, pp. 194- 203 ,(1975) , 10.1109/TIT.1975.1055349
L. Davisson, Universal noiseless coding IEEE Transactions on Information Theory. ,vol. 19, pp. 783- 795 ,(1973) , 10.1109/TIT.1973.1055092