Implementace základních kódů proměnné délky

Abstract

The aim of my work was to learn a few basic methods of variable-length coding for the numbers and the characters. Thereafter, I implemented them to the compression framework and compared their efficiency. There were chosen Phased-In encoding, encoding Redundancy-Feedback, Self-Delimiting coding including Simple-9 coding and Huffman coding, in the assignment. In agreement with the supervisor was dropped from testing variants of Huffman coding in favor of advanced prefix variable lengths coding. Within this task, I tested Levenstein coding, Elias Gamma coding, Elias Omega coding, Exponential Golomb coding and Fibonacci coding. During the comparison of the effectiveness, I primarily focused on saving space acquired by data compression. The implementation was performed on a range of input values ​​<1, 2147483647>, with the exception of the Simple-9 encoding, which can only be encoded by numbers up to 268435455, according to the definition. The comparison of coding efficiency was examined on a set of test files provided by the supervisor.