00000ctm a22000004a 4500 UP-99796217602381330 Buklod 20230503092542.0 m |o d | ta 070803s1997 xx r |||| u|eng d (iLib)UPD-00000125358 DML eng DMLUC LG 995 1997 E6 A58 Agustin, Luisito L. A multiple-extension adaptive Huffman code Luisito L. Agustin. 235 leaves Computer print-out. Thesis (M.S.)--University of the Philippines, Diliman. This thesis consists of the design, implementation, and evaluation of a lossless data compression code that uses adaptive Huffman techniques for encoding multiple extensions of a source alphabet. The proposed code uses dual encoding trees as in [Lu..] along with modifications to the adaptive Huffman code [Gallager] that allow the algorithm to handle multiple extensions of the source as is done in dictionary-based compressors. The compression ratios achieved using a software implementation of the proposed code is evaluated against compression ratios achieved by other data compression schemes. Results show that the proposed code achieves better compression ratios Huffman-type codes and LZW. However, the higher compression ratios do not exceed those achieved by high orders of arithmetic coding and popular data compression utilities in use. Data compression (Computer science). Algorithms. Coding theory. Thesis Fi UP UPD DARCHIVES LG 995 1997 E6 A58 UPD DENG-II LG 995 1997 E6 A58 Thesis