Generating a canonical prefix encoding
Eugene S. Schwartz, Bruce Kallick · Communications of the ACM · 1964
Computer programs for generating a minimum-redundancy exhaustive prefix encoding are described. One program generates a Huffman frequency tree, another determines the structure functions of an encoding, and a third program assigns codes.