Please use this identifier to cite or link to this item:
|Title:||Efficient data compression scheme based on semi-adaptive Huffman coding for moderately large Chinese text files|
|Authors:||Ong, Ghim Hwee |
Huang, Shell Ying
|Citation:||Ong, Ghim Hwee,Huang, Shell Ying (1995). Efficient data compression scheme based on semi-adaptive Huffman coding for moderately large Chinese text files. Proceedings of IEEE Singapore International Conference on Networks/International Conference on Information Engineering IEEE SICON/ICIE : 332-336. ScholarBank@NUS Repository.|
|Abstract:||This paper presents a data compression scheme for Chinese text files. Due to the skewness of the distribution of Chinese ideograms, the Huffman coding method is adopted. By storing the Huffman tree in the coding table and representing the Huffman tree using the Zaks sequence, the algorithm produces significant improvement on the compression results. The proposed method is evaluated by comparing its performance with three well-known compression algorithms and an algorithm specially designed to compress the coding table. This algorithm should also be applicable to other ideogram-based or oriental language texts. Also, it has the potential to reduce the dictionary size in a bigram or trigram-based semi-adaptive compression scheme for English texts.|
|Source Title:||Proceedings of IEEE Singapore International Conference on Networks/International Conference on Information Engineering IEEE SICON/ICIE|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 16, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.