| Language: | Slovenian |
|---|---|
| Year of publishing: | 2022 |
| Typology: | 2.11 - Undergraduate Thesis |
| Organization: | UL FRI - Faculty of Computer and Information Science |
| Publisher: | [R. Perkovič] |
| UDC: | 004.627(043.2) |
| COBISS: |
124635651
|
| Views: | 29 |
| Downloads: | 10 |
| Average score: | 0 (0 votes) |
| Metadata: |
|
| Secondary language: | English |
|---|---|
| Secondary title: | Data compression using Huffman coding |
| Secondary 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. |
| Secondary keywords: | encoding;compression;decompression;data;Huffman's code;Lempel-Ziv code;computer science;diploma;Kodiranje;Računalništvo;Univerzitetna in visokošolska dela; |
| Type (COBISS): | Bachelor thesis/paper |
| Study programme: | 1000470 |
| Embargo end date (OpenAIRE): | 1970-01-01 |
| Thesis comment: | Univ. v Ljubljani, Fak. za računalništvo in informatiko |
| Pages: | 42 str. |
| ID: | 16542965 |