论文标题
1位延迟可解码代码的霍夫曼代码的最佳性
Optimality of Huffman Code in the Class of 1-bit Delay Decodable Codes
论文作者
论文摘要
对于给定的独立和相同分布的（I.I.D.）源，Huffman代码可以使用单个代码表实现瞬时代码类中的最佳平均密码字长度。但是，众所周知，存在使用多个代码表的时间变化的编码器，它比Huffman代码达到的平均代码长度较短，并且最多允许k = 2、3、4，。 。 ..另一方面，尚不清楚是否存在1位延迟可解码的代码，该代码的平均长度比Huffman代码短。本文证明了给定的I.I.D.来源，Huffman代码实现了具有有限数量的代码表的1位延迟可解码代码的最佳平均代码长度。
For a given independent and identically distributed (i.i.d.) source, Huffman code achieves the optimal average codeword length in the class of instantaneous code with a single code table. However, it is known that there exist time-variant encoders, which achieve a shorter average codeword length than the Huffman code, using multiple code tables and allowing at most k-bit decoding delay for k = 2, 3, 4, . . .. On the other hand, it is not known whether there exists a 1-bit delay decodable code, which achieves a shorter average length than the Huffman code. This paper proves that for a given i.i.d. source, a Huffman code achieves the optimal average codeword length in the class of 1-bit delay decodable codes with a finite number of code tables.
