Abstract
dc:descriptionIn theory it is known that encoding of information blocks of variable length with fixed length code words usually results in a less efficient compression than encoding of information blocks of fixed length with variable length code words. However, the former method also has its advantages. Data encoded with fixed length codes is easily decodable and error resilient. Fixed length encoding also enables search in compressed data. Furthermore, the strict structure of encoded files means that such files can be encoded again with the potential of increasing compression. This paper describes an experiment consisting of three parts. In the experiment standard Tunstall code, suffix tree modification for Tunstall code, Huffman code and Elias Delta code combined with MTF (move to front) transformation as well as combinations of these codes are used. The codes are used to compress files from three different categories: randomly generated files, files of a specific (BMP) format and files from Silesia corpus, which is a set of files created for the purpose of testing compression algorithms. The aim of the experiment is to compare fixed length and variable length codes and their combinations in practice and to assess their effectiveness and the advantages of code combinations over individual codes in terms of compression.
Degree
thesis:*- Grantor dc:publisher
- Institutional Repository of Vilnius University
- Year dc:date
- 2022
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Raginis, Bernardas,
Rights
dc:rights- Statement dc:rights
-
- info:eu-repo/semantics/openAccess
- Language dc:language
- lit
Identifiers
dc:identifier.*- Repository record dc:identifier
- https://repository.vu.lt/VU:ELABAETD146237055&prefLang=en_US