By Topic

A fast-adaptive Huffman coding algorithm

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)
W. -W. Lu ; Sch. of Eng. & Appl. Sci., Sussex Univ., Brighton, UK ; M. P. Gough

The Huffman code in practice suffers from two problems: the prior knowledge of the probability distribution of the data source to be encoded is necessary, and the encoded data propagate errors. The first problem can be solved by adaptive coding, while the second problem can be partly solved by segmenting data into segments. However, the adaptive Huffman code performs badly when segmenting data into relatively small segments because of its relatively slow adaptability. A fast-adaptive coding algorithm which tracks the local data statistics more quickly, thus yielding better compression efficiency, is given

Published in:

IEEE Transactions on Communications  (Volume:41 ,  Issue: 4 )