| 最小冗余编码及其程序设计 |
| |
| 引用本文： | 肖剑英.最小冗余编码及其程序设计[J].南京邮电大学学报(自然科学版),1987(1). |
| |
| 作者姓名： | 肖剑英 |
| |
| 摘 要： | 本文用图论中的最优树构成法证明哈夫曼编码方法是最小冗余的最优码。设计了相应的编码和解码程序,可对信息进行无差错的压缩和恢复。
|
| 关 键 词： | 程序设计 冗余编码 最优树 哈夫曼编码 图论算法 |
Minimum-Redundancy Code and its Program Design |
| |
| Xiaoi Jianying.Minimum-Redundancy Code and its Program Design[J].Journal of Nanjing University of Posts and Telecommunications,1987(1). |
| |
| Authors: | Xiaoi Jianying |
| |
| Institution: | Xiaoi Jianying |
| |
| Abstract: | In this paper it has been proved by the optimal tree construction of graph theory that Huffman's code is an optimal method of coding with minimum redundancy. The respondent computer program is designed to code and decode, in this way the information can be compressed or recovered without distortion. |
| |
| Keywords: | Programming Redundancy encoding Optimal tree Huffman coding Graph-theoretical algorithms |
| 本文献已被 CNKI 等数据库收录！ |
