SLO | ENG | Cookies and privacy

Bigger font | Smaller font

Show document

Title:Uporaba prefiksnih kod za stiskanje Hammingove kode
Authors:Kerman, Valentin (Author)
Mongus, Domen (Mentor) More about this mentor... New window
Files:.pdf VS_Kerman_Valentin_2018.pdf (1,03 MB)
 
Language:Slovenian
Work type:Bachelor thesis/paper (mb11)
Typology:2.11 - Undergraduate Thesis
Organization:FERI - Faculty of Electrical Engineering and Computer Science
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, Shannon-Fano algoritem, Huffmanov algoritem
Year of publishing:2018
Publisher:V. Kerman
Source:[Maribor
UDC:004.627:004.415.3(043.2)
COBISS_ID:21919510 Link is opened in a new window
License:CC BY-ND 4.0
This work is available under this license: Creative Commons Attribution No Derivatives 4.0 International
Views:169
Downloads:13
Metadata:XML RDF-CHPDL DC-XML DC-RDF
Categories:KTFMB - FERI
:
  
Average score:(0 votes)
Your score:Voting is allowed only for logged in users.
Share:AddThis
AddThis uses cookies that require your consent. Edit consent...

Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Secondary language

Language:English
Title:Usage of prefix codes for compressing Hamming code
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.
Keywords:Error correcting code, Hamming coding, Shannon-Fano algorithm, Huffman algorithm


Comments

Leave comment

You have to log in to leave a comment.

Comments (0)
0 - 0 / 0
 
There are no comments!

Back
Logos of partners University of Maribor University of Ljubljana University of Primorska University of Nova Gorica