| Webster's Online Dictionary |
| Expressions | Domain | Definition | |
| Huffman encoding | Math | A minimal variable-length character encoding based on the frequency of each character. First, each character becomes a trivial tree, with the character as the only node. The character's frequency is the tree's frequency. The two trees with the least frequencies are joined with a new root which is assigned the sum of their frequencies. This is repeated until all characters are in one tree. One code bit represents each level. Thus more frequent characters are near the root and are encoded with few bits, and rare characters are far from the root and are encoded with many bits. (references) | |
| K-ary Huffman encoding | Math | A minimal variable-length encoding based on the frequency of each character. Similar to a Huffman encoding, but joins k trees into a k-ary tree at each step, and uses k symbols for each level. (references) | |
Source: compiled by the editor from various references; see credits. | Top | ||
