Minimax noiseless universal coding for Markov sources
作者： L. Davisson
关键词:
摘要: Upper and lower bounds are presented on the minimax redundancy for Markov source noiseless block-to-variable universal coding. The number of states, block size, order arbitrary but finite. Unlike earlier results, upper absolute, that is, not merely asymptotic. bound is established by combinatorial bounds. a average an distribution transition probabilities. can be optimized across choice distribution.
sci-hub.se 参考文章(3)
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
L. Davisson, G. Longo, A. Sgarro, The error exponent for the noiseless encoding of finite ergodic Markov sources IEEE Transactions on Information Theory. ,vol. 27, pp. 431- 438 ,(1981) , 10.1109/TIT.1981.1056377
L. Davisson, Universal noiseless coding IEEE Transactions on Information Theory. ,vol. 19, pp. 783- 795 ,(1973) , 10.1109/TIT.1973.1055092