Code and parse trees for lossless source encoding (Q1429270)

A number of interesting variants of coding and parsing problems have appeared in the literature since the Huffman code. The fixed-to-variable-length lossless source code trees are called code trees, where as variable-length-to-fixed lossless source code trees are called parse trees. The author gives a comprehensive survey of the theoretical literature on code trees and parse trees. This is an excellent survey paper, and will serve as a useful guide to the existing literature. There are 312 references in this paper.