Key points are not available for this paper at this time.
A universal data compression algorithm is described which is capable of compressing long strings generated by a "finitely generated" source, with a near optimum per symbol length without prior knowledge of the source. This class of sources may be viewed as a generalization of Markov sources to random fields. Moreover, the algorithm does not require a working storage much larger than that needed to describe the source generating parameters.
Building similarity graph...
Analyzing shared references across papers
Loading...
J. Rissanen (Thu,) studied this question.
www.synapsesocial.com/papers/6a11c2f3276e1b6925c909bc — DOI: https://doi.org/10.1109/tit.1983.1056741
J. Rissanen
IEEE Transactions on Information Theory
IBM (United States)
Building similarity graph...
Analyzing shared references across papers
Loading...