Huffman coding as an algorithm to construct chains in partition lattices
classification
🧮 math.CO
keywords
algorithmchainshuffmancodingcorrespondlatticepartitionalphabet
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.