Published:
2020, Proceedings of the SOFSEM 2020 Doctoral Student Research Forum, Aachen, CEUR Workshop Proceedings), p. 25-36), ISSN 1613-0073
Annotation:
Multistream Compression has proven to be competitive in terms of compression ratio. It utilizes a binary tree structure which follows practically the same rules for its construction as the Huffman method. This tree structure is ideal in terms of compression ratio for creation of codewords by Huffman compression. Comparing to the Huffman method the Multistream Compression is based on different idea of how to compress data. This fact raises the question whether the same tree structure provides the best performance. The presented paper investigates possible improvements of the tree structure. A genetic algorithm application was created for this purpose. The design of this application is presented in the paper as well as the obtained results. The whole application is set to the context of the MSC trees.