By Topic

Incremental Calculation of Minimum-Redundancy Length-Restricted Codes

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)
Mike Liddell ; Dept. of Comput. Sci. & Software Eng., Univ. of Melbourne, Vic. ; Alistair Moffat

The length-restricted code-construction problem arises when using prefix codes for large messages and also for search-tree depth minimization. A problem instance comprises an ordered set of input probabilities which in this paper are assumed, without loss of generality, to be a set of unnormalized integer frequencies {f1 , f2,..., fn}, and a maximum codeword length L bits. The package-merge algorithm of Larmore and Hirschberg constructs a minimum-redundancy length-restricted code in O(nL) time. Here we present an algorithm which computes a minimum-redundancy length-restricted code in O((H L + 1)n) time, by starting with a minimum-redundancy (Huffman) code with a maximum codeword length of H, and then refining it to meet the length limit L. The new algorithm is suited to problems where H - L is small; and when H - L > L - [log n], the new algorithm outperforms all previous methods. Experimental results confirm the behavior of the new algorithm

Published in:

IEEE Transactions on Communications  (Volume:55 ,  Issue: 3 )