Implementace adaptivního Golomb kódování s možností využití pro presistentí datové struktury

Abstract

Thesis talks about way of adaptive Golomb encoding implementation. More precisely, explains Rice code with possibility of using universal utilization in wider range then experiented. Thesis includes experimental comparation with chosen codes such as Elias-delta and Fibonacci code of second and third order. This work also explains principes of encoding and decoding of these codes and shows esence of adaptability Golomb code and its implementation. Next part talks about some trivial ways of compression of numbers which are suitable in combination with used codes. Final part summaries test results and their explanation.