关于Shannon编码的若干注记

Some notes on Shannon code

通过反例指出若干对Shannon编码中关于舍入的误解,并利用区间二叉树给出Shannon编码的简单证明。提出了Shannon编码成立的弱条件,它能保证Shannon编码仍是前缀码。

The misunderstanding of the round in Shannon code from some textbooks is corrected, and the corresponding counterexample is constructed. Then a simple proof for Shannon code based on interval binary tree is presented. Furthermore, a weak condition for Shannon code is presented, and it can ensure that Shannon code is prefix free.