Data compression represents one of the most important fields of information theory. It seeks to reduce the quantity of data used to store or transmit information. The thesis starts with a brief description of algorithms and principles used for data compression. Continues with the main focus on two algorithms – Lempel-Ziv-Welch and Huffman, where each one represents a different type of compression technique. Algorithms are then implemented in the C programming language. In order to make implementation simple to use, a graphical interface is designed with the help of the GTK open source library. Finally, both algorithms are tested on several types of files such as text, image, binary file, etc. Results are then used for a more in-depth analysis.
|
