摘要
数据压缩是信息科学中的一项重要的技术,利用Huffman算法得到的前缀码可以使文件总编码长度最短.通过对算法进行分析和改进,优化了算法,从而使Huffman编码更简洁、实用.
Data compaction is an important technique of the computer science,prefix codes gained by using Huffman algorithm can make the total length of codes in the file shortest.By analyzing and improving the algorithm,it is optimized,and then becomes concise and applicable.
出处
《兰州铁道学院学报》
2003年第3期120-121,128,共3页
Journal of Lanzhou Railway University
