Package-merge algorithm
id:
package-merge-algorithm-257-10226476
title:
Package-merge algorithm
text:
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 by reducing the code construction problem to the binary coin collector's problem.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Package-merge_algorithm
date created:
date modified:
2023-10-24T01:40:18Z
main entity:
{"identifier":"Q7122881","url":"https://www.wikidata.org/entity/Q7122881"}
image:
fields total:
13
integrity:
13