Publication
IEEE Trans. Inf. Theory
Paper

A Universal Data Compression System

View publication

Abstract

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

Date

01 Jan 1983

Publication

IEEE Trans. Inf. Theory

Authors

Topics

Share