首页 | 本学科首页   官方微博 | 高级检索  
     

关于Shannon编码的若干注记
引用本文:谢勰. 关于Shannon编码的若干注记[J]. 西安邮电学院学报, 2009, 14(3): 58-60
作者姓名:谢勰
作者单位:西安邮电学院信息与控制系,陕西,西安,710121
摘    要:通过反例指出若干对Shannon编码中关于舍入的误解,并利用区间二叉树给出Shannon编码的简单证明。提出了Shannon编码成立的弱条件,它能保证Shannon编码仍是前缀码。

关 键 词:Shannon编码  区间二叉树  前缀码

Some notes on Shannon code
XIE Xie. Some notes on Shannon code[J]. Journal of Xi'an Institute of Posts and Telecommunications, 2009, 14(3): 58-60
Authors:XIE Xie
Affiliation:XIE Xie (Information and Control Department, Xi'an University of Post and Telecommunications, Xi'an 710121, China)
Abstract: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.
Keywords:Shannon code  interval binary tree  prefix code
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号