Universal data compression algorithms by using normal tree models

Universal data compression algorithms are the algorithms by which source data can be coded without a priori knowledge of statistics of a source. This paper describes two techniques for constructing and updating normal trees-adding and discarding. Two universal data compression algorithms and their tree source models are proposed and their implementations are suggested. These algorithms are evaluated by three parameters-the normalized average code lengths, required memory spaces, and encoding complexities.