| 哈夫曼树的构造及其在信息编码中的应用 |
| |
| 引用本文： | 任正云.哈夫曼树的构造及其在信息编码中的应用[J].沙洋师范高等专科学校学报,2007,8(5):31-33. |
| |
| 作者姓名： | 任正云 |
| |
| 作者单位： | 荆门职业技术学院,湖北,荆门,448000 |
| |
| 摘 要： | 哈夫曼树就是最优二叉查找树,对于带权的二叉树的查找,权值最大的离根结点最近,按照这一思路,带权结点所构成的所有二叉树中带权路径长度WPL最小的二叉树,将其应用于计算机通信中数据编码技术可大大缩短电文代码的长度。
|
| 关 键 词： | 哈夫曼树构造 数据编码要求 应用 |
| 文章编号： | 1672-0768（2007）05-0031-03 |
| 修稿时间： | 2007-03-19 |
Compostion of the Huffman Tree and its Usage in Digital Compiling |
| |
| REN zheng-yun.Compostion of the Huffman Tree and its Usage in Digital Compiling[J].Journal of Shayang Teachers College,2007,8(5):31-33. |
| |
| Authors: | REN zheng-yun |
| |
| Institution: | Jingmen Technical College,Jingmen, Hubei 448000 |
| |
| Abstract: | Huffman Tree is the best Binary Searching Tree.About the searching for Binarry Tree with times,the highest will be the neatest to the root.According to the thoughts,the Binary Trees composed by nod with righ,and take the shortest WPL load length with right into the usage of digital compile technology of computer communication and it can shorten the length of the telegram greatly. |
| |
| Keywords: | Huffman Tree Compose Digital Compiling Apply |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
