Preeti Malakar, Thomas George, et al.
SC 2012
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. © 1983 IEEE
Preeti Malakar, Thomas George, et al.
SC 2012
Chidanand Apté, Fred Damerau, et al.
ACM Transactions on Information Systems (TOIS)
György E. Révész
Theoretical Computer Science
Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002