该博客讨论了Huffman编码的历史和在计算机科学中的重要性。作者指出，Huffman编码不唯一，导致在评估学生的编码作业时遇到挑战。文章说明了一个输入验证程序的需求，该程序用于确定学生提交的Huffman编码是否正确。输入包括字符及其频率，以及学生的多个编码尝试。输出应表明每个编码是否为有效的前缀码。
7-1 Huffman Codes （30 分）
In 1953, David A. Huffman published his paper "A Method for the Construction of Minimum-Redundancy Codes", and hence printed his name in the history of computer science. As a professor who gives the final exam problem on Huffman codes, I am encountering a big problem: the Huffman codes are NOT unique. For example, given a string "aaaxuaxz", we can observe that the frequencies of the characters 'a', 'x', 'u' and 'z' are 4, 2, 1 and 1, respectively. We may either encode the symbols as {'a'=0, 'x'=10, 'u'=110, 'z'=111}, or in another way as {'a'=1, 'x'=01, 'u'=001, 'z'=000}, both compress the string into 14 bits. Another set of code can be given as {'a'=0, 'x'=11, 'u'=100, 'z'=101}, but {'a'=0, 'x'=01, 'u'=011, '
最低0.47元/天 解锁文章
扫一扫
813
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
