Code and parse trees for lossless source encoding

Abstract

The fixed-to-variable-length lossless source code trees, called code trees, and the variable-length-to-fixed lossless source code trees, called parse trees are investigated. Huffman coding is a code tree problem, but there are a number of interesting variants of the problem formulation which lead to other combinatorial optimization problems. In particular, code tree topics and parse tree topics are outlined and discussed.