摘要
针对在文本解压缩过程中对动态数据进行权重统计较为困难这一问题,提出了一种采用三叉链表的解压缩算法。首先采用链表对动态文本中的不同字符进行统计,得到相应字符的权重;在此基础上,再利用三叉链表构造赫夫曼树并对其进行赫夫曼编码;最后采用位运算对赫夫曼编码进行无损的数据压缩和解压。实验表明,该算法运行效率高,实现简单,具有较高的应用价值。
Due to the difficulty of weight statistic for dynamical data in the compression and decompression process, a compression and decompression method based on trifurcate chain table is proposed in this paper. First, in order to achieve the weight of each character, each different character in dynamical text file was accounted by employing chain table. Then the Huffman tree was constructed and Huffman coding was completed by using trifurcate chain table. Finally, the lossless compression and decompression for Huffman coding was completed by using bit- operation. Experience results reveal that the proposed method has a high application value for the advantages of high efficiency and realized easily in practice.
出处
《铜仁学院学报》
2015年第4期117-119,150,共4页
Journal of Tongren University
基金
贵州省教育厅教学质量与教学改革工程项目(黔高教发[2013]446-9号)研究成果
关键词
文本
动态数据
三叉树
解压缩
Text
dynamical data
ternary tree
compression and decompression