diplomsko delo
Valentin Kerman (Author), Domen Mongus (Mentor)

Abstract

Medtem ko se vsebolj zanašamo na prenos podatkov preko raznovrstnih komunikacijskih omrežij, postaja pomembno tudi učinkovito preverjanje njihove pravilnosti. V ta namen uporabljamo kode za odkrivanje in popravljanje napak, ki pa v podatke vnašajo redundanco in posledično zmanjšujejo gostoto informacije. To diplomsko delo se osredotoča na možnosti povečanja gostote zapisa z uporabo prefiksnih kod. V ta namen smo preučili več načinov stiskanja podatkov in preverili njihovo učinkovitost pri stiskanju Hamingove kode. Z rezultati smo pokazali, da takšen pristop omogoča zmanjšanje potrebne količine podatkov, vendar je slednje zelo odvisno od vhodnega niza.

Keywords

popravljanje napak;Hammingovo kodiranje;Huffmanov algoritem;diplomske naloge;

Data

Language: Slovenian
Year of publishing:
Typology: 2.11 - Undergraduate Thesis
Organization: UM FERI - Faculty of Electrical Engineering and Computer Science
Publisher: V. Kerman
UDC: 004.627:004.415.3(043.2)
COBISS: 21919510 Link will open in a new window
Views: 850
Downloads: 106
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: Usage of prefix codes for compressing Hamming code
Secondary abstract: With the ever growing need for data transfer across a variety of communication networks, verification of data correctness is becoming increasingly importnant. For this purpose, we use error detection and correction codes that introduce redundancy into the data and, consequently, reduce the density of the contained information. This diploma thesis focuses on the possibility of increasing the information density using prefix codes. For this purpose, we examined several approaches to data compression and verified their effectiveness in compressing the Haming code. The results showed that such an approach reduces the data size, however, its efficiency highly depends on the input data.
Secondary keywords: error correcting code;Hamming coding;Shannon-Fano algorithm;Huffman algorithm;
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: IV, 35 f.
ID: 10982540