Access the full text.
Sign up today, get DeepDyve free for 14 days.
MJ Weinberger, J Rissanen, M Feder (1995)
A Universal Finite State Memory SourceIEEE Trans. Inform. Theory, 41
F Willems, Yu Shtarkov, T Tjalkens (1995)
The Context-Tree Weighting Method: Basic PropertiesIEEE Trans. Inform. Theory, 41
YuM Shtarkov (2013)
Universal’noe kodirovanie. Teoriya i algoritmy
RE Krichevsky, VK Trofimov (1981)
The Performance of Universal CodingIEEE Trans. Inform. Theory, 27
YuM Shtarkov, TjJ Tjalkens, FMJ Willems (1997)
Multialphabet Weighting Universal Coding of Context Tree SourcesProbl. Peredachi Inf., 33
YuM Shtarkov (1987)
Universal Sequential Coding of Single MessagesProbl. Peredachi Inf., 23
YuM Shtarkov (1999)
Aim Functions and Sequential Estimation of the Source Model for Universal CodingProbl. Peredachi Inf., 35
Often, for a source to be encoded it is only known (or assumed) that its model belongs to some known family; parameters of models are unknown. The number of context Markov models in a family can be enormous, and methods for finding the best of them to describe a current block (message fragment of length n) have not been discussed previously. We propose a way to solve this problem and describe a coding algorithm.
Problems of Information Transmission – Springer Journals
Published: Oct 16, 2014
Access the full text.
Sign up today, get DeepDyve free for 14 days.