000 04195nam a2200301Ia 4500
001 76928
003 FT6114
005 20251107105946.0
008 190311n 000 0 eng d
040 _erda
041 _aengtag
050 _a267
082 _a267
100 _aJohn Mark R. Leyson and Katherine Joy G. Perpetua.
245 0 _aFurther enhancement of LZW++ algorithm applied to text compression and decompression
264 _a.
_b.
_cc2014
300 _bUndergraduate Thesis: (BS in Computer Studies major in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2014.
336 _b.
_atext
_2rdacontent
337 _30
_b.
_aunmediated
_2rdamedia
338 _30
_b.
_avolume
_2rdacarrier
505 _aABSTRACT Lempel-Ziv-Welch (LZW) is a general compression algorithm capable of working on almost any type of data but the researchers focused on different text file compression and decompression. It is a “dictionary”-based compression algorithm. This means that instead of tabulating character counts and building trees, LZW encodes data referencing a dictionary. The main purpose of this study is to enhance the technique of existing LZW++ Algorithm for data compression and decompression and to broaden the capability of the algorithm in doing its process into different text files. This study focuses on text compression and decompression of text file formats such as: .txt, .doc, .docx, .rtf, .html, .php, .dotm, .odt, .vbs, .ccp and .xml file only. Many assessments have been done to this study such as testing the previous application just to come up with a better version of LZW++ algorithm that in the existing system. However, after the several tests, the enhanced algorithm came up with a better version and better capability when it comes to compression and decompression. LZW++ Algorithm is used for text compression Image compression is however possible but it is not used in the algorithm. This algorithm can probably be developed and used in image compression and decompression by the same process applied. The algorithm will read three pixels and allocate each of three pixels in a dictionary so that it could be compressed. After the tests, it is concocluded that this study helped a lot in development of the algorithm. Broader capability of the algorithm to handle text files can greatly help in people who always use data compression and decompression.
506 _a5
520 _aABSTRACT Lempel-Ziv-Welch (LZW) is a general compression algorithm capable of working on almost any type of data but the researchers focused on different text file compression and decompression. It is a dictionary-based compression algorithm. This means that instead of tabulating character counts and building trees, LZW encodes data referencing a dictionary. The main purpose of this study is to enhance the technique of existing LZW++ Algorithm for data compression and decompression and to broaden the capability of the algorithm in doing its process into different text files. This study focuses on text compression and decompression of text file formats such as: .txt, .doc, .docx, .rtf, .html, .php, .dotm, .odt, .vbs, .ccp and .xml file only. Many assessments have been done to this study such as testing the previous application just to come up with a better version of LZW++ algorithm that in the existing system. However, after the several tests, the enhanced algorithm came up with a better version and better capability when it comes to compression and decompression. LZW++ Algorithm is used for text compression Image compression is however possible but it is not used in the algorithm. This algorithm can probably be developed and used in image compression and decompression by the same process applied. The algorithm will read three pixels and allocate each of three pixels in a dictionary so that it could be compressed. After the tests, it is concocluded that this study helped a lot in development of the algorithm. Broader capability of the algorithm to handle text files can greatly help in people who always use data compression and decompression.
526 _aF
540 _a5
655 _a.
942 _alcc
_cMS
_2lcc
999 _c10071
_d10071