| 王礼广,杨晓霖,王敏灵.多叉树Huffman算法[J].南华大学学报(自然科学版),2004,(4):29~32.[.The Multiple Tree Huffman Algorithm[J].Journal of University of South China(Science and Technology),2004,(4):29~32.] |
| 多叉树Huffman算法 |
| The Multiple Tree Huffman Algorithm |
| 修订日期：2004-08-27 |
| DOI： |
| 中文关键词: Huffman算法 数据压缩 多叉树 解码 码长 信息处理 |
| 英文关键词:Huffman algorithm, Data compression, Multiple tree |
| 基金项目: |
| 王礼广 杨晓霖 王敏灵 |
[1]国防科技大学理学院,湖南长沙410073／／南华大学数理学院,湖南衡阳421001 [2]南华大学数理学院,湖南衡阳421001 [3]香港伟易达集团VTE电子开发部(深圳)
,广东深圳518000 |
| 摘要点击次数: 870 |
| 全文下载次数: 3 |
| 中文摘要: |
| 改进Huffnan算法，提出了多叉树Huffnan算法．理论分析表明该算法优于常规的Huffnan算法，其平均码长已接近信源的熵函数值，且其解码速度快．将其实现用于文本压缩，压缩比大约为3：1左右．该算法已长期用于众多产品中，取得了良好的效果。 |
| 英文摘要: |
| This paper improves the Huffman algorithm, and proposes the multiple tree Huffman algorithm. The theoretic analysis shows that this algorithm is better than universal Huffman algorithm and its mean code length approximates the value of the entropy function. And its decoding rate of velocity is very fast. Its compression rate is about 3:1, while the algorithm is realized and employed in compressing text. This algorithm has been used in many products for a long time, and a good effort is achieved. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| 关闭 |
|
|
|