Universal coding for arbitrarily varying sources and for hierarchies of model classes
暂无分享,去创建一个
[1] R. Gallager. Information Theory and Reliable Communication , 1968 .
[2] Toby Berger,et al. Review of Information Theory: Coding Theorems for Discrete Memoryless Systems (Csiszár, I., and Körner, J.; 1981) , 1984, IEEE Trans. Inf. Theory.
[3] Neri Merhav,et al. Optimal sequential probability assignment for individual sequences , 1994, IEEE Trans. Inf. Theory.
[4] Jorma Rissanen,et al. Complexity of strings in the class of Markov sources , 1986, IEEE Trans. Inf. Theory.
[5] Jorma Rissanen,et al. Universal coding, information, prediction, and estimation , 1984, IEEE Trans. Inf. Theory.
[6] Neri Merhav,et al. Universal coding for arbitrarily varying sources , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[7] M. Feder,et al. A stronger version of the redundancy-capacity theorem of universal coding , 1994, Proceedings of 1994 Workshop on Information Theory and Statistics.