Hierarchical universal coding
暂无分享,去创建一个
[1] Andrew R. Barron,et al. Minimum complexity density estimation , 1991, IEEE Trans. Inf. Theory.
[2] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.
[3] Jorma Rissanen,et al. Complexity of strings in the class of Markov sources , 1986, IEEE Trans. Inf. Theory.
[4] Neri Merhav,et al. Optimal sequential probability assignment for individual sequences , 1994, IEEE Trans. Inf. Theory.
[5] R. Gallager. Information Theory and Reliable Communication , 1968 .
[6] Lee D. Davisson,et al. Minimax noiseless universal coding for Markov sources , 1983, IEEE Trans. Inf. Theory.
[7] B. G. Quinn,et al. The determination of the order of an autoregression , 1979 .
[8] Alberto Leon-Garcia,et al. A source matching approach to finding minimax codes , 1980, IEEE Trans. Inf. Theory.
[9] Lee D. Davisson,et al. Universal noiseless coding , 1973, IEEE Trans. Inf. Theory.
[10] Thomas M. Cover,et al. On the competitive optimality of Huffman codes , 1991, IEEE Trans. Inf. Theory.
[11] JORMA RISSANEN,et al. A universal data compression system , 1983, IEEE Trans. Inf. Theory.
[12] Frans M. J. Willems,et al. The context-tree weighting method: basic properties , 1995, IEEE Trans. Inf. Theory.
[13] A. Barron,et al. Jeffreys' prior is asymptotically least favorable under entropy risk , 1994 .
[14] Andrew R. Barron,et al. Information-theoretic asymptotics of Bayes methods , 1990, IEEE Trans. Inf. Theory.
[15] J. Rissanen. Stochastic Complexity and Modeling , 1986 .
[16] M. Feder,et al. Predictive stochastic complexity and model estimation for finite-state processes , 1994 .
[17] A. Barron,et al. APPROXIMATION OF DENSITY FUNCTIONS BY SEQUENCES OF EXPONENTIAL FAMILIES , 1991 .
[18] Neri Merhav,et al. A strong version of the redundancy-capacity theorem of universal coding , 1995, IEEE Trans. Inf. Theory.
[19] Steven Rudich,et al. Inferring the Structure of a Markov Chain from its Output , 1985, FOCS.