Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Package-merge algorithm
open-in-new
<p>The package-merge algorithm is an <i><a href="/facts/Big_O_notation/weFFjSWg">O</a>(nL)</i>-time algorithm for finding an optimal <a href="/facts/Length-limited_Huffman_code/dBgMBz48">length-limited Huffman code</a> for a given distribution on a given alphabet of size <i>n</i>, where no <a href="/facts/Code_word_(communication)/sASREopJ">code word</a> is longer than <i>L</i>. It is a <a href="/facts/Greedy_algorithm/alfsekco">greedy algorithm</a>, and a generalization of <a href="/facts/Huffman_coding/dBgMBz48">Huffman's original algorithm</a>. Package-merge works by reducing the code construction problem to the binary <i><a href="/facts/Coupon_collector%2527s_problem/owu3Q7gp">coin collector's problem</a></i>. </p>