By Topic

Universal data compression algorithms by using normal tree models

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
S. -Y. Chang ; GoldStar Inf. & Commun. Ltd., Anyang R&D Lab., Kyungki, South Korea

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

Published in:

Networks, 1993. International Conference on Information Engineering '93. 'Communications and Networks for the Year 2000', Proceedings of IEEE Singapore International Conference on  (Volume:2 )

Date of Conference:

6-11 Sep 1993