Annotation

Slovak University of Technology, Bratislava
Faculty of Electrical Engineering and Information Technology
Degree Course: INFORMATICS
Author: Bc. Viktor Beňo
Diploma thesis: Compression possibilities of Berlakamp - Massey algorithm
Supervisor: prof. RNDr. Otokar Grošek, CSc.
December 2001

This work deals with the applications of Berlekamp - Massey algorithm, especially the compression possibilities and the unicity distance changes are considered and explorated.

Within this project several algorithms were developed and implemented in order to get some compression results with the use of Berlekamp - Massey algorithm. Also a program using real compression methods (Huffman coding, ZIP) mixed with Berlekamp - Massey algorithm was implemented. The substantial part of the project is dedicated to the determination of the unicity distance of the output files. This way, it is possible to find out if the security of the files increased or decreased.

Testing revealed that Berlekamp - Massey algorithm is far less effective as a compressor compared to the other ones, but several types of files showed quite good compression.

On the other hand, the unicity distance showed very good results. This happened by reducing the redundancy of the source and thus greatly enlarging the unicity distance of the file. Tests revealed other algorithms quite useful, too, especially when used in combination with Berlekamp - Massey algorithm.