頁籤選單縮合
題名 | A Locally Adaptive Coding Scheme for Chinese Text Files |
---|---|
作 者 | 張克章; 陳信宏; | 書刊名 | Journal of Information Science and Engineering |
卷期 | 11:1 1995.03[民84.03] |
頁次 | 頁51-71 |
分類號 | 312.49 |
關鍵詞 | Locally adaptive coding scheme; Data compression; Two-dimensional linked list; Locality of reference; Huffman coding; |
語文 | 英文(English) |
英文摘要 | A locally adaptive data compression scheme for Chinese text files is proposed in this paper. The proposed scheme is essentially a one-pass data compression algorithm in which the compression and decompression routines can be conducted simultaneously. The proposed scheme is developed on the basis of a two-dimensional linked list and the locality of reference. An identical number of lists in the two-dimensional linked list and identical contents of each linked list are always controlled as the coding process is during operation. Each character is encoded by a positional integer prefixed by several zeros. Additionally, an integer character followed by the original BIG-5 code is used to encode a character which has appeared for the first time. The locality of reference is implemented by the move-to-front operation with which the positional integers for frequently encountered characters can be encoded on a small scale. Furthermore, several empirical tests for various types of Chinese text files are implemented, revealing that the compression ratios of the proposed scheme are greater than 50%. Results obtained from the empirical tests clearly verify the advantages of the proposed scheme over other methods. |
本系統之摘要資訊系依該期刊論文摘要之資訊為主。