By Topic

Universal data compression algorithms by using full 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

2 Author(s)
S. -Y. Chang ; Dept. of Electr. & Comput. Eng., Pennsylvania State Univ., University Park, PA, USA ; J. J. Metzner

Summary form only given. A brief description and results of analysis of splitting and merging for constructing and updating full trees is provided. Since all the leaves are assumed to have equal probability, using these two tree-updating procedures the variable-to-fixed length codes are realized. Two algorithms are suggested. One is devised by modifying the Ziv-Lempel algorithm. The number of leaves varies but is always a power of the size of an encoded output alphabet. In the second algorithm trees always have a fixed number of leaves which is the power of the size of the encoded output alphabet. The two proposed algorithms are evaluated by the normalized average code length per source output symbol, required memory space to store information about trees, and encoding complexity

Published in:

Data Compression Conference, 1991. DCC '91.

Date of Conference:

8-11 Apr 1991