Implementace kódů proměnné délky pro celá čísla

Abstract

The goal of the works was to acquaint with several types of encoding variable lenght for integral numbers, to analyze their implementation in terms of potencional use in the compression framework and to compare their effectiveness. I chose the Fibonacci code, the Generalized Fibonacci code, the Goldbach codes, the Additive codes, the Golomb and the Rice code. When evaluating the encoding efficiency, I focused on wether and under what conditions is the encoding useful in comperision with regular thirty-two sign binary representation. The implementation was made for a range of input value < 1; 2147483647 > expect the Additive and Goldbach codes G0. The implementation of the Additive codes was canceled and the implementation of the Goldbach codes G0 was limited to a maximum code leght 120 000 bites, after the consultation with the supervisor. The comparing of the effectiveness was made on the provided test files. In case of Goldbach codes G0 the extent of testing was limited.