diplomsko delo
Jure Sreš (Author), Bogdan Lipuš (Mentor)

Abstract

Algoritmi za stiskanje podatkov so v računalništvu prisotni že od samega začetka. Igrajo pomembno vlogo pri prenosu in shranjevanju velikih količin podatkov, razdelimo pa jih lahko na več načinov. Poznamo izgubno in brezizgubno stiskanje. Glede na način izvajanja ločimo statistično in stiskanje s slovarjem. V tem diplomskem delu bomo predstavili algoritme LZW, LZAP, LZMW in LZY, ki uporabljajo slovar in podatke stisnejo brezizgubno. Predstavili bomo njihovo delovanje in primerjali rezultate.

Keywords

stiskanje podatkov;stiskanje s slovarjem;primerjava algoritmov;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: J. Sreš
UDC: 004.627(043.2)
COBISS: 20067606 Link will open in a new window
Views: 10738
Downloads: 133
Average score: 0 (0 votes)
Metadata: JSON JSON-RDF JSON-LD TURTLE N-TRIPLES XML RDFA MICRODATA DC-XML DC-RDF RDF

Other data

Secondary language: English
Secondary title: VARIANTS OF THE LZW ALGORITHM
Secondary abstract: Data compression algorithms are present in the computer science from the very beginning. They play a major role in transmitting and storing a large amount of data and can be divided in various ways. In general, they can be entropy or dictionary-based. A compression can be performed lossy or lossless. We present the algorithms LZW, LZAP, LZMW and LZY, that compress data losslessly and use dictionary in the process. We examine the presented algorithms and the results of compression.
Secondary keywords: data compression;dictionary-based compression;algorithm comparison;
URN: URN:SI:UM:
Type (COBISS): Bachelor thesis/paper
Thesis comment: Univ. v Mariboru, Fak. za elektrotehniko, računalništvo in informatiko, Računalništvo in informacijske tehnologije
Pages: VI, 30 str.
ID: 9166675