Stiskanje podatkov s Huffmanovim kodiranjem

PERKOVIČ, ROK (author), Šter, Branko (mentor)

Vsebina tega dela predstavlja del področja stiskanja podatkov. Cilj je raziskati področje in se s praktičnim delom približati obstoječim rešitvam in s tem odgovoriti na vprašanja, ki bi se lahko pojavila v povezavi s področjem. Pred samo implementacijo je kratek vpogled v teoretično ozadje področja, iz katerega je potem rešitev izpeljana. Glavna tema v besedilu je algoritem Huffmanovo kodiranje, algoritem iz družine Lempel-Ziv pa je predstavljen in uporabljen za primerjavo dveh algoritmov z enakim končnim ciljem, ki pa ga dosegata na drugačen način. Predstavljeno je njuno delovanje in izvedena je primerjava učinkovitosti. Za lažjo in uporabniku bolj prijazno uporabo je razvit tudi grafični vmesnik.

• Language: Slovenian
• Keywords: kodiranje, stiskanje, razširjanje, podatki, Huffmanov kod, kod Lempel-Ziv
• Work type: Bachelor thesis/paper
• Typology: 2.11 - Undergraduate Thesis
• Organization: FRI - Faculty of Computer and Information Science
• Year: 2022
• PID: 20.500.12556/RUL-141043
• COBISS.SI-ID: 124635651
• Publication date in RUL: 22.09.2022

Secondary language

• Language: English
• Title: Data compression using Huffman coding

Abstract

The content of this thesis describes a part of the data compression field. The goal is to examine and imitate existing solutions and with that answer possible questions regarding data compression. Before we dive into details of implementation, we take a look at the theory behind it. Main topic is the Huffman`s algorithm and algorithm from a Lempel-Ziv family which is explained and used as a comparison of the two algorithms that have the same goal but are achieving it with different techniques. Their operation is briefly explained and a comparative study between the two is performed.

• Keywords: encoding, compression, decompression, data, Huffman`s code, Lempel-Ziv code