Abstract
In this paper, different combination of compression techniques based on Huffman Algorithm and Run Length Encoding applied to a set of four thousands of Chinese characters are presented. A data compression technique based on Run Length Algorithm and Huffman coding for Chinese characters is presented. The common points of these two schemes are the simplification of the coding methods. Unlike other compression techniques, these two schemes are not too computational involved and it can be decompressed very easily with very little CPU time. Another attraction for these coding methods is that they are lossless compression techniques.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the Data Compression Conference |
| Editors | James A. STORER, Martin COHN |
| Publisher | IEEE |
| ISBN (Print) | 0818656379 |
| Publication status | Published - 1994 |
| Externally published | Yes |
| Event | Data Compression Conference - Snowbird, UT, USA Duration: 29 Mar 1994 → 31 Mar 1994 |
Conference
| Conference | Data Compression Conference |
|---|---|
| City | Snowbird, UT, USA |
| Period | 29/03/94 → 31/03/94 |