Tunstall Parse Trees Optimum under Various Criteria

摘要: The well known Tunstall algorithm for discrete memoryless sources [17] produces optimal variable-to-fixed length source codes that maximize the expected number of letters per codeword. Tun stall achieves this result by constructing parse trees with maximum average height output. In first part paper we introduce a simple variant in order to optimizes additional natural cost functions interest. For instance show how select, among all height, those having minimum variance, external length, and more general parameters. second consider problem selecting, bounded some parameter L, height. We motivate problem, quantify loss performance these suffer respect unrestricted Tuns tall trees, when they are used as encoding source.