Huffman coding as an algorithm to construct chains in partition lattices
Combinatorics
2013-06-25 v1
Abstract
The Huffman coding algorithm is interpreted in the lattice of partitions of the source alphabet. Maximal chains in the partition lattice correspond to linear extensions of tree orders, and those among the chains that exhibit a simple greedy property correspond precisely to executions of the Huffman algorithm.
Keywords
Cite
@article{arxiv.1306.5497,
title = {Huffman coding as an algorithm to construct chains in partition lattices},
author = {Stephan Foldes},
journal= {arXiv preprint arXiv:1306.5497},
year = {2013}
}