Parker D. Stott

D. Stott Parker

Information about the author D. Stott Parker will soon be added to the site.
Found 1 papers in total
The construction of Huffman codes is a submodular (‘convex’) optimization problem over a lattice of binary trees
1999
We show that the space of all binary Huffman codes for a finite alphabet defines a...
Papers per page: