Oliver Bodemer
IBM J. Res. Dev
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
Oliver Bodemer
IBM J. Res. Dev
Nanda Kambhatla
ACL 2004
David S. Kung
DAC 1998
Hendrik F. Hamann
InterPACK 2013