Affiliation:
1. Information Engineering University
2. PLA
3. Henan University of Technology
Abstract
Huffman coding is a statistical lossless coding method with high efficiency. The principal and implementation of Huffman coding is discussed and Huffman coding is implemented to the compression of vector maps. The property of the algorithm is discussed. Experiments demonstrated that the algorithm proposed can compress vector maps with high efficiency and no loss.
Publisher
Trans Tech Publications, Ltd.
Reference8 articles.
1. Y. WANG and C. ZHU. The Vector Relief Data Compression Based on The Multi-Band Wavelet. Science of Surveying and Mapping, 2003, 28(3): 66-68. (in Chinese).
2. S. ZHONG, Q. GAO. An Efficient Lossless Compression Algorithm for A Kind of Two-Dimension Vector Maps. Journal of System Simulation, 2004, 16(10): 2189-2194. (in Chinese).
3. D. A. HUFFMAN. A method for the construction of minimum redundancy codes. Proc IRE, 1952, 40(9): 1098-1101.
4. A. JONATHAN. Data Compression with Huffman Coding. Byte, 1986, 11(5): 99-108.
5. F. SAEED, H LU, and G. E Hedrick. Data Compression with Huffman Coding: An Efficient Dynamic Implementation Using File Partitioning. Proceedings of the 1990 Symposium on Applied Computing, 1990: 348-354.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献