{"version":"1.0","type":"link","title":"Package-merge algorithm - Newikis","description":"The package-merge algorithm is an O(nL)-time algorithm for finding an optimal length-limited Huffman code for a given distribution on a given alphabet of size n, where no code word is longer than L. It is a greedy algorithm, and a generalization of Huffman's original algorithm. Package-merge works…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}